Skip to main content
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, 2019 at 13:15
What would it mean to disprove Church-Turing thesis?
Awarded Dec 23, 2018 at 9:00
Automated theorem proving in linear logic
Awarded Dec 22, 2015 at 14:09
What is the most intuitive dependent type theory I could learn?
Awarded May 20, 2013 at 22:36
Relationship between Turing Machine and Lambda calculus?
Awarded Jul 28, 2012 at 18:17
Higher-order algorithms
Awarded Jun 12, 2012 at 20:02
Using lambda calculus to derive time complexity?
Awarded Jul 17, 2011 at 11:55
Does the System F with pairs have the strong normalisation and subject reduction properties?
Awarded Jun 9, 2011 at 18:51
What algorithms are known for computing Craig interpolants?
Awarded May 18, 2011 at 8:08
Small steps for better TCS conferences?
Awarded May 17, 2011 at 13:48
Small steps for better TCS conferences?
Awarded May 8, 2011 at 19:08
Translating SAT to HornSAT
Awarded Nov 8, 2010 at 17:55
Are lambda calculus and combinatory logic the same?
Awarded Oct 24, 2010 at 11:58
When should you say what you know?
Awarded Oct 21, 2010 at 23:41
Regular expressions aren't
Awarded Sep 6, 2010 at 9:26

Others with this badge