Theoretical Computer Science

Nice Answer

 Nice Answer
Answer score of 10 or more. This badge can be awarded multiple times.

earned this badge 15 times.
Can we prove weak normalization for System F by induction on a transfinite ordinal
Awarded Jan 25 '19 at 13:15
What would it mean to disprove Church-Turing thesis?
Awarded Dec 23 '18 at 9:00
Automated theorem proving in linear logic
Awarded Dec 22 '15 at 14:09
What is the most intuitive dependent type theory I could learn?
Awarded May 20 '13 at 22:36
Relationship between Turing Machine and Lambda calculus?
Awarded Jul 28 '12 at 18:17
Higher-order algorithms
Awarded Jun 12 '12 at 20:02
Using lambda calculus to derive time complexity?
Awarded Jul 17 '11 at 11:55
Does the System F with pairs have the strong normalisation and subject reduction properties?
Awarded Jun 9 '11 at 18:51
What algorithms are known for computing Craig interpolants?
Awarded May 18 '11 at 8:08
Small steps for better TCS conferences?
Awarded May 17 '11 at 13:48
Small steps for better TCS conferences?
Awarded May 8 '11 at 19:08
Translating SAT to HornSAT
Awarded Nov 8 '10 at 17:55
Are lambda calculus and combinatory logic the same?
Awarded Oct 24 '10 at 11:58
When should you say what you know?
Awarded Oct 21 '10 at 23:41
Regular expressions aren't
Awarded Sep 6 '10 at 9:26

Others with this badge