|Nice Answer||Answer score of 10 or more. This badge can be awarded multiple times.|
Neel Krishnaswami earned this badge 55 times
mar 18 at 16:53Does there exist an extension of regular expressions that captures the context free languages?
mar 6 at 1:24logic in the presence of doubt, uncertainty, lies
feb 27 at 9:45What is a commutative transitive closure operator?
jan 11 at 20:37Free theorems, where?
dec 28 at 20:44Is there such a thing as a state-based programming language?
nov 21 at 8:03Frame rule as a change-preserver?
nov 12 at 16:52How are Futures described in terms of category theory?
nov 3 at 9:12Can any program be implemented mechanically?
nov 2 at 21:10Is it possible to decide $\beta$-equivalence within System F (or another normalizing typed λ-calculus)?
sep 11 at 17:06A mathematical (categorical) description of type classes
aug 12 at 2:47Proofs techniques related to Curry–Howard correspondence
jul 7 at 10:48Feasibility of Gödel machines
jun 4 '12 at 9:53Unary parametricity vs. binary parametricity
mar 27 '12 at 20:30Where is the proof that Coq + Excluded Middle is consistent
mar 11 '12 at 19:05Halting problem, uncomputable sets: common mathematical proof?
mar 10 '12 at 4:07Data Structure isomorphisms
mar 9 '12 at 17:35Programming languages with canonical functions
mar 8 '12 at 18:29What's the difference between ADTs, GADTs, and inductive types?
feb 27 '12 at 0:30In domain theory, what can the extra structure present in metric spaces be used for?
feb 18 '12 at 15:42What is the point of calling $\lambda$-calculus an algebra?
jan 20 '12 at 23:56Functions that typed lambda calculus cannot compute
jan 18 '12 at 16:07Class of functions computable by Coq
jan 4 '12 at 22:39When can we say that two programs are different?
sep 28 '11 at 23:20Computational hardness of “real” computer programs
sep 9 '11 at 18:54Data structures in programming language with linear types
sep 1 '11 at 9:49A category of NP-complete problems?
jul 28 '11 at 19:33What are the equational laws for zero types?
jun 27 '11 at 8:57Why is it so difficult for a computer to prove something?
may 23 '11 at 5:31Is there any other algorithm whose worst-case running time is exponential meanwhile it works very well in practice other than Simplex Algorithm?
may 11 '11 at 9:24Do dependent types give you everything subtyping does?
apr 4 '11 at 3:34Classification of Typed/Untyped Lambda Calculi
mar 9 '11 at 17:53Why do we need formal semantics for predicate logic?
mar 4 '11 at 15:58Curry-Howard and programs from non-constructive proofs
mar 1 '11 at 20:51Relationship between contracts and dependent typing
feb 9 '11 at 14:34Axioms necessary for theoretical computer science
feb 4 '11 at 21:20Applications of metric structures on posets/lattices in theoryCS
jan 31 '11 at 19:17Where do most REGEX implementations fall on the complexity scale?
jan 12 '11 at 0:53How are imperative languages more different from each other than functional languages?
jan 6 '11 at 15:38Is there a sensible notion of an approximation algorithm for an undecidable problem?
jan 2 '11 at 18:34What do we know about provably correct programs?
dec 31 '10 at 1:17How do I choose a functional dictionary data structure?
dec 24 '10 at 17:28Why naturals instead of integers?
nov 9 '10 at 5:36Shallow versus Deep Embeddings
nov 6 '10 at 13:14Can the cost of GC be neglected when analyzing the running time of worst-case data structures specified in a garbage-collected programming language?
oct 30 '10 at 2:10Difference lists in functional programming
oct 26 '10 at 3:35Context Sensitive Grammars and Types
oct 21 '10 at 3:50How are side effects handled in semantics?
sep 10 '10 at 10:16Realizability theory: difference in power between Lambda calculus and Turing Machines
sep 4 '10 at 18:51Solid applications of category theory in TCS?