13
votes
How to get cabal to ignore the global package DB when using a sandbox
haskell
ubuntu
ghc
cabal
package-managers
asked Feb 5, 2014 at 19:57
stackoverflow.com
12
votes
Is there a book/survey-paper outlining language class hierarchies, closure properties, etc
reference-request
co.combinatorics
fl.formal-languages
automata-theory
research-practice
asked May 28, 2013 at 20:05
cstheory.stackexchange.com
12
votes
Is there an efficient test for if an NFA accepts a subset of another NFA?
algorithms
regular-languages
automata
np-complete
decision-problem
asked Feb 20, 2013 at 6:11
cs.stackexchange.com
12
votes
How to derive dependently typed eliminators?
reference-request
recursion
type-theory
dependent-types
inductive-datatypes
asked Mar 23, 2018 at 18:58
cs.stackexchange.com
12
votes
State of the Art for the Monadic Class?
reference-request
lo.logic
automated-theorem-proving
program-verification
first-order-logic
asked Nov 5, 2017 at 8:04
cstheory.stackexchange.com
12
votes
Proof techniques for showing that dependent type checking is decidable
reference-request
pl.programming-languages
type-theory
dependent-type
typed-lambda-calculus
asked Oct 11, 2018 at 4:59
cstheory.stackexchange.com
12
votes
Intuition Behind Strict Positivity?
reference-request
pl.programming-languages
type-theory
type-systems
dependent-type
asked Apr 2, 2019 at 0:27
cstheory.stackexchange.com
11
votes
Hereditary substitution with a universe hierarchy
reference-request
lo.logic
pl.programming-languages
type-theory
lambda-calculus
asked Nov 22, 2018 at 23:02
cstheory.stackexchange.com
11
votes
Is the reversal of a minimal DFA also minimal?
formal-languages
reference-request
automata
finite-automata
asked May 7, 2014 at 19:51
cs.stackexchange.com
11
votes
Can an NP-hard problem be polynomial on average?
complexity-theory
reference-request
np-complete
probabilistic-algorithms
amortized-analysis
asked Jul 16, 2014 at 17:53
cs.stackexchange.com
prev
1
2
3
4
5
…
10
next