Damiano Mazza's user avatar
Damiano Mazza's user avatar
Damiano Mazza's user avatar
Damiano Mazza
  • Member for 10 years, 4 months
  • Last seen this week
6 votes
Accepted

Nondeterministic Turing Machines as deciders, versus NP and co-NP

2 votes

Denotational semantics of intersection types

7 votes
Accepted

Example of a term in system F which is not typable in the simply typed lambda calculus

3 votes
Accepted

Is there an efficient algorithm to check for duplicator-invariant equivalence on symmetric interaction combinators?

13 votes
Accepted

Where is the model theory in programming language theory?

6 votes
Accepted

Lambda-calculus: Beta-equivalent terms have the same type

6 votes
Accepted

Terminal object in the category of embeddings

3 votes
Accepted

Fixed-point combinator on arithmetic functions

3 votes
Accepted

How exactly does a compatible reduction relation change the $\pi$-calculus?

10 votes

How does linear logic achieve resource management?

9 votes
Accepted

What is the complexity class of higher-order primitive recursion?

5 votes
Accepted

Fixed points of fixed-point combinator?

8 votes
Accepted

Are there strongly normalizing lambda terms that cannot be given a System F type?

6 votes

Phonology and lambda calculus

3 votes
Accepted

Does focused proof search ever have to backtrack across the choice of focus formula?

12 votes
Accepted

Is there an efficient beta-equivalence algorithm?

2 votes

"Refined" list of open problems in TCS

6 votes

How do conference proceedings add to academic prestige?

5 votes

Equivalent formulation of complexity theory in Lambda Calculus?

7 votes
Accepted

A stronger multiplexing rule for soft linear logic?

4 votes
Accepted

Does this variant of Multiplicative Linear Logic with mix rule enjoy cut elimination?

3 votes
Accepted

Is the set of Multiplicative Proof Nets a proper subset of set of well formed single-agent Interaction Nets?

5 votes

Philosophy behind monotonicity requirement for inductive types

6 votes

Calculus of Constructions: compress expression to its smallest form

9 votes
Accepted

Can you assign a type to any term of the λEA-calculus?

4 votes
Accepted

What, in simple terms, are the restrictions imposed by Elementary Affine Logic?

10 votes
Accepted

Why is the multi-step reduction of semantics reflexive?

8 votes
Accepted

Do we care about confluence because of unique normal forms?

15 votes

(How) Could we discover/analyze NP problems in the absence of the Turing model of computation?

8 votes

Hierarchies in regular languages