Joey Eremondi's user avatar
Joey Eremondi's user avatar
Joey Eremondi's user avatar
Joey Eremondi
  • Member for 10 years, 9 months
  • Last seen more than a week ago
26 votes
6 answers
2k views

Advanced techniques for determining complexity lower bounds

21 votes
5 answers
848 views

What notable automaton models have polynomially-decidable containment?

16 votes
1 answer
543 views

Are there variants of visibly pushdown automata that allow pushing of words onto the stack?

12 votes
1 answer
387 views

Is there a book/survey-paper outlining language class hierarchies, closure properties, etc

12 votes
2 answers
457 views

State of the Art for the Monadic Class?

12 votes
1 answer
969 views

Proof techniques for showing that dependent type checking is decidable

12 votes
2 answers
754 views

Intuition Behind Strict Positivity?

11 votes
2 answers
445 views

Hereditary substitution with a universe hierarchy

8 votes
1 answer
519 views

PHOAS with extrinsic typing?

7 votes
1 answer
464 views

Avoiding Cycles with Unification and Subtyping

7 votes
1 answer
130 views

Quanitifier Free Presburger Arithmetic: Upper bound on solution size?

6 votes
2 answers
440 views

Preservation under Substitution with Telescopes

6 votes
2 answers
299 views

Typing of substitution in a bidirectional type system

6 votes
2 answers
187 views

Are deterministic context-free languages closed under outfix (or other erasing operations)

6 votes
0 answers
397 views

Reverse Skolemization?

6 votes
1 answer
169 views

Conservative Approximation of Kleene-Mycroft Iteration for Polymorphic Recursion?

6 votes
1 answer
232 views

Structural equality of Pi Types with heterogeneous equality?

6 votes
1 answer
319 views

Fixed set of type constructors to simulate all intensional inductive families?

5 votes
1 answer
177 views

What language $L \in NCM$ has $\overline{L} \not \in NCM$?

5 votes
1 answer
259 views

Can emptiness of reversal-bounded counter languages be decided in time polynomial to the number of counters?

4 votes
1 answer
278 views

What characterizations exist for the grammars that can express subsets of the context-free languages?

4 votes
0 answers
169 views

Hereditary Substitution with Inductives and Eliminators?

4 votes
0 answers
118 views

Proof that CIC or Dybjer-style eliminators are strongly-normalizing?

3 votes
1 answer
153 views

Notion of "quotient" or "inverse" for recognizable tree languages?

3 votes
0 answers
156 views

Set:Set or Negative Inductives in a Total Language?

2 votes
1 answer
85 views

Nominal Tree Languages i.e. with Binders and Infinite Symbols?

2 votes
0 answers
70 views

Regular Tree Languages are closed under quotient?

2 votes
1 answer
104 views

Are Reversal-bounded Multicounter Machines closed under reversal?

2 votes
1 answer
118 views

Is it decidable whether the langauge accepted by a reversal-bounded counter machine is deterministic?

1 vote
0 answers
483 views

Equality Constraints over Sets with Tree Automata