User Sam Tobin-Hochstadt

37 votes

Most memorable CS paper titles

answered Oct 22, 2014 at 14:50

23 votes

Accepted

Is there an expressiveness hierarchy for type systems?

answered Sep 15, 2011 at 22:38

19 votes

Accepted

Historic Relationship between Typed Lambda Calculus and Lisp?

answered Jun 25, 2014 at 13:25

11 votes

Accepted

Research on call-site based type inference?

answered Nov 28, 2011 at 16:42

11 votes

Is there a survey of the semantics of various programming language features?

answered Apr 6, 2011 at 12:57

10 votes

Is there any programming language theory describing foreign function interfaces (FFI) and multiple language bindings?

answered Apr 6, 2011 at 12:54

10 votes

Applications of Game theory in computer science?

answered Jan 23, 2013 at 19:31

9 votes

Accepted

Are register based machines on von neumann architecture diametrically opposed to functional programming style?

answered Jan 31, 2012 at 3:34

8 votes

Beautiful results in TCS

answered Feb 28, 2012 at 18:18

8 votes

Accepted

Automatic proofs or model checking in an extremely simplified functional language

answered Jan 27, 2012 at 19:43

8 votes

Accepted

Resumption-based IO systems?

answered Nov 28, 2012 at 7:33

7 votes

Early References for Transition System Semantics of Programs

answered Jul 20, 2012 at 13:11

6 votes

Accepted

Classes and types in object-oriented languages

answered Aug 31, 2012 at 14:48

6 votes

(concise?) definition of thread safety

answered Feb 7, 2012 at 22:32

6 votes

Reynolds: "the basic laws of variable binding"

answered Jan 29, 2012 at 20:57

6 votes

Functions that typed lambda calculus cannot compute

answered Jan 11, 2012 at 15:20

6 votes

TCS conferences for undergraduate students?

answered Jun 25, 2014 at 13:30

4 votes

Relationship between shift-reduce parsing and delimited continuations?

answered Mar 22, 2014 at 22:10

3 votes

Mathematical explanation of recursion and lambda (referenced in The Little Schemer)

answered Jun 4, 2012 at 15:00

2 votes

Accepted

Is contextual equivalence of a language with `quote`-`eval` trivial or not?

answered Mar 22, 2014 at 22:06

2 votes

What tools do you use to give presentations?

answered Aug 18, 2011 at 3:03

2 votes

Is there any work done on developing difference-calculus of Turing Machines (or simpler Formal Languages)

answered Dec 14, 2011 at 15:22

1 vote

Are there any annotated formal verification systems for pure functional programming languages?

answered Oct 10, 2014 at 4:29

Stack Exchange Network

23 Answers

Most memorable CS paper titles

Is there an expressiveness hierarchy for type systems?

Historic Relationship between Typed Lambda Calculus and Lisp?

Research on call-site based type inference?

Is there a survey of the semantics of various programming language features?

Is there any programming language theory describing foreign function interfaces (FFI) and multiple language bindings?

Applications of Game theory in computer science?

Are register based machines on von neumann architecture diametrically opposed to functional programming style?

Beautiful results in TCS

Automatic proofs or model checking in an extremely simplified functional language

Resumption-based IO systems?

Early References for Transition System Semantics of Programs

Classes and types in object-oriented languages

(concise?) definition of thread safety

Reynolds: "the basic laws of variable binding"

Functions that typed lambda calculus cannot compute

TCS conferences for undergraduate students?

Relationship between shift-reduce parsing and delimited continuations?

Mathematical explanation of recursion and lambda (referenced in The Little Schemer)

Is contextual equivalence of a language with `quote`-`eval` trivial or not?

What tools do you use to give presentations?

Is there any work done on developing difference-calculus of Turing Machines (or simpler Formal Languages)

Are there any annotated formal verification systems for pure functional programming languages?