User Blaisorblade

17 votes

Accepted

Why was Schönfinkel's work on eliminating "bound variables" in logic so crucial?

answered Feb 14, 2015 at 9:52

8 votes

Technical article vs. research paper

answered Jan 9, 2015 at 15:23

8 votes

For which algorithms is there a large gap between the theoretical analysis and reality?

answered Sep 9, 2010 at 3:48

6 votes

Has anyone used Pottier and Gauthier's polymorphic defunctionalization in a modular compiler?

answered Jun 13, 2017 at 1:39

6 votes

What are the uses of Limits and Colimits of Category Theory in every day problems?

answered Jan 5, 2015 at 17:15

5 votes

What are the uses of Limits and Colimits of Category Theory in every day problems?

answered Jan 5, 2015 at 17:23

5 votes

Where do most REGEX implementations fall on the complexity scale?

answered Sep 10, 2010 at 15:36

4 votes

Are there intermediate eta theories for the lambda calculus?

answered May 16, 2013 at 4:08

4 votes

Are lambda calculus and combinatory logic the same?

answered Sep 8, 2010 at 22:07

4 votes

Simple balanced trees with O(1) concat?

answered Sep 8, 2010 at 22:49

2 votes

Is eta-equivalence for functions compatiable with Haskell's seq operation?

answered Mar 24, 2014 at 17:29

1 vote

Church's Theorem and Gödel's Incompleteness Theorems

answered Jan 13, 2011 at 2:26

1 vote

Regular expressions aren't

answered Sep 10, 2010 at 14:42

0 votes

For what languages is there already a theory of observational equivalence?

answered Mar 7, 2015 at 9:44

-1 votes

Distinguishing semantics vs syntactic techniques and the syntax of your semantic domains

answered Mar 6, 2015 at 10:10

Stack Exchange Network

15 Answers

Why was Schönfinkel's work on eliminating "bound variables" in logic so crucial?

Technical article vs. research paper

For which algorithms is there a large gap between the theoretical analysis and reality?

Has anyone used Pottier and Gauthier's polymorphic defunctionalization in a modular compiler?

What are the uses of Limits and Colimits of Category Theory in every day problems?

What are the uses of Limits and Colimits of Category Theory in every day problems?

Where do most REGEX implementations fall on the complexity scale?

Are there intermediate eta theories for the lambda calculus?

Are lambda calculus and combinatory logic the same?

Simple balanced trees with O(1) concat?

Is eta-equivalence for functions compatiable with Haskell's seq operation?

Church's Theorem and Gödel's Incompleteness Theorems

Regular expressions aren't

For what languages is there already a theory of observational equivalence?

Distinguishing semantics vs syntactic techniques and the syntax of your semantic domains