User Charles Stewart

49 votes

Accepted

Regular expressions aren't

answered Aug 24, 2010 at 11:57

49 votes

Small steps for better TCS conferences?

answered May 8, 2011 at 9:02

35 votes

Accepted

Relationship between Turing Machine and Lambda calculus?

answered Aug 26, 2010 at 13:24

28 votes

Accepted

Translating SAT to HornSAT

answered Aug 18, 2010 at 10:46

21 votes

Accepted

Using lambda calculus to derive time complexity?

answered Aug 22, 2010 at 21:10

17 votes

Accepted

Are lambda calculus and combinatory logic the same?

answered Aug 19, 2010 at 11:18

16 votes

Accepted

What algorithms are known for computing Craig interpolants?

answered Aug 29, 2010 at 8:02

15 votes

When should you say what you know?

answered Oct 21, 2010 at 8:47

15 votes

What is the most intuitive dependent type theory I could learn?

answered Apr 20, 2011 at 9:45

14 votes

Accepted

Does the System F with pairs have the strong normalisation and subject reduction properties?

answered Sep 2, 2010 at 17:59

13 votes

Higher-order algorithms

answered Aug 23, 2010 at 9:24

11 votes

Small steps for better TCS conferences?

answered May 8, 2011 at 9:08

11 votes

Automated theorem proving in linear logic

answered Nov 29, 2011 at 21:59

10 votes

Accepted

Can we prove weak normalization for System F by induction on a transfinite ordinal

answered Oct 27, 2011 at 12:29

10 votes

What would it mean to disprove Church-Turing thesis?

answered Sep 3, 2010 at 7:23

8 votes

Why do we need formal semantics for predicate logic?

answered Sep 20, 2010 at 11:36

7 votes

Handbook of Logic in Computer Science - is it worth it?

answered Aug 31, 2010 at 7:58

7 votes

Looking for papers and articles on modal substructural logics

answered Apr 14, 2011 at 7:41

7 votes

Accepted

Is there a systematic method for constructing lambda calculus terms that can distinguish between inputs?

answered Jun 7, 2013 at 12:02

7 votes

Accepted

What is resolution ((in FOL))?

answered Aug 9, 2013 at 18:57

7 votes

Accepted

Typing relations terminology – how do I read typing relations?

answered Aug 13, 2013 at 7:35

6 votes

Characterising invisible equivalences by confluent rewrite rules

answered Aug 30, 2010 at 12:15

6 votes

How are side effects handled in semantics?

answered Aug 27, 2010 at 9:19

6 votes

What are the most effective algorithms to find random number?

answered Aug 24, 2010 at 12:26

5 votes

Why can Lambda Calculus not represent some combinators?

answered Aug 26, 2010 at 13:18

5 votes

Looking for papers and articles on higher-order sequent systems

answered Apr 14, 2011 at 7:49

5 votes

Can consume/produce be modeled in linear logic?

answered May 5, 2011 at 8:24

4 votes

What is the difference between propositions and judgments?

answered Apr 18, 2012 at 9:20

3 votes

How hard is it to reduce termination to partial correctness?

answered Aug 23, 2010 at 12:42

2 votes

Dinner-table description of theoretical computer science?

answered Sep 20, 2010 at 11:08

Stack Exchange Network

30 Answers

Regular expressions aren't

Small steps for better TCS conferences?

Relationship between Turing Machine and Lambda calculus?

Translating SAT to HornSAT

Using lambda calculus to derive time complexity?

Are lambda calculus and combinatory logic the same?

What algorithms are known for computing Craig interpolants?

When should you say what you know?

What is the most intuitive dependent type theory I could learn?

Does the System F with pairs have the strong normalisation and subject reduction properties?

Higher-order algorithms

Small steps for better TCS conferences?

Automated theorem proving in linear logic

Can we prove weak normalization for System F by induction on a transfinite ordinal

What would it mean to disprove Church-Turing thesis?

Why do we need formal semantics for predicate logic?

Handbook of Logic in Computer Science - is it worth it?

Looking for papers and articles on modal substructural logics

Is there a systematic method for constructing lambda calculus terms that can distinguish between inputs?

What is resolution ((in FOL))?

Typing relations terminology – how do I read typing relations?

Characterising invisible equivalences by confluent rewrite rules

How are side effects handled in semantics?

What are the most effective algorithms to find random number?

Why can Lambda Calculus not represent some combinators?

Looking for papers and articles on higher-order sequent systems

Can consume/produce be modeled in linear logic?

What is the difference between propositions and judgments?

How hard is it to reduce termination to partial correctness?

Dinner-table description of theoretical computer science?