User Noam Zeilberger

91 votes

Accepted

Solid applications of category theory in TCS?

answered Sep 4, 2010 at 11:43

27 votes

Accepted

What are the practical issues with intersection and union types?

answered Jan 11, 2014 at 10:57

21 votes

Discharged hypotheses in ->Introduction

answered Feb 1, 2011 at 13:58

19 votes

Accepted

Implicit vs explicit subtyping

answered Dec 28, 2010 at 15:07

18 votes

What do we know about provably correct programs?

answered Jan 2, 2011 at 12:36

17 votes

Why do we need formal semantics for predicate logic?

answered Sep 20, 2010 at 14:25

15 votes

How are real numbers specified in computation?

answered Oct 10, 2010 at 9:40

13 votes

What is the difference between unification and anti-unification?

answered Mar 16, 2016 at 23:33

12 votes

Incomplete basis of combinators

answered Aug 5, 2016 at 10:36

12 votes

Representing bound variables with a function from uses to binders

answered Sep 8, 2018 at 0:23

10 votes

Accepted

Are Primitive Recursive Functions Iterative?

answered Dec 7 at 9:37

10 votes

Cut-elimination for calculus with nats or other inductive datatype?

answered Dec 23, 2010 at 12:00

10 votes

Are there knot theoretic formulations of NP complete problems?

answered Nov 6, 2014 at 12:26

9 votes

Accepted

Can all linear lambda calculi be linearity checked syntactically?

answered Jul 9, 2015 at 5:04

8 votes

Implementation of surreal numbers for games

answered Oct 5, 2014 at 14:40

8 votes

Looking for papers and articles on modal substructural logics

answered Apr 1, 2011 at 10:30

8 votes

Accepted

Complexity of type inference in the simply typed lambda calculus

answered Oct 2, 2020 at 7:21

7 votes

Accepted

Efficient way to generate random planar cubic bipartite graphs

answered Jan 29, 2018 at 11:25

7 votes

Accepted

What is higher-order in higher-order abstract syntax?

answered Dec 4, 2013 at 13:04

7 votes

Continuation passing transform of binary functions

answered Dec 28, 2013 at 13:57

6 votes

Looking for papers and articles on higher-order sequent systems

answered Apr 2, 2011 at 8:31

6 votes

Are there semi-decision procedures for this theory?

answered Jan 6, 2011 at 17:11

6 votes

Density of semantics in syntax

answered Feb 26, 2021 at 15:58

6 votes

List of nice non-context-free languages

answered Mar 8 at 5:42

6 votes

What relations and differences are between formal semantics for linguistics and for programming languages?

answered Aug 19, 2020 at 16:39

5 votes

Faithful functors vs forgetful functors: exact category-theoretic defs?

answered Apr 18, 2014 at 12:22

4 votes

A Lambda calculus for invertible (r-Turing computable) functions

answered Feb 7, 2014 at 13:30

4 votes

Accepted

Morphisms between $\varepsilon$-NFAs

answered Nov 17 at 9:20

4 votes

Representations of Planar Graphs in Coq

answered Jul 5, 2019 at 7:19

Stack Exchange Network

29 Answers

Solid applications of category theory in TCS?

What are the practical issues with intersection and union types?

Discharged hypotheses in ->Introduction

Implicit vs explicit subtyping

What do we know about provably correct programs?

Why do we need formal semantics for predicate logic?

How are real numbers specified in computation?

What is the difference between unification and anti-unification?

Incomplete basis of combinators

Representing bound variables with a function from uses to binders

Are Primitive Recursive Functions Iterative?

Cut-elimination for calculus with nats or other inductive datatype?

Are there knot theoretic formulations of NP complete problems?

Can all linear lambda calculi be linearity checked syntactically?

Implementation of surreal numbers for games

Looking for papers and articles on modal substructural logics

Complexity of type inference in the simply typed lambda calculus

Efficient way to generate random planar cubic bipartite graphs

What is higher-order in higher-order abstract syntax?

Continuation passing transform of binary functions

Looking for papers and articles on higher-order sequent systems

Are there semi-decision procedures for this theory?

Density of semantics in syntax

List of nice non-context-free languages

What relations and differences are between formal semantics for linguistics and for programming languages?

Faithful functors vs forgetful functors: exact category-theoretic defs?

A Lambda calculus for invertible (r-Turing computable) functions

Morphisms between $\varepsilon$-NFAs

Representations of Planar Graphs in Coq