User Rob Simmons

17 votes

Accepted

Automated theorem proving in linear logic

answered Nov 19, 2011 at 23:50

15 votes

What is the most powerful kind of parser?

answered Oct 23, 2010 at 5:04

14 votes

Accepted

Type inference for imperative statements other than assignment

answered Nov 9, 2011 at 16:19

13 votes

How to make the Lambda Calculus strong normalizing without a type system?

answered Dec 30, 2013 at 1:20

12 votes

Curriculum: Logical/Formal Methods in Security

answered Nov 15, 2010 at 2:15

11 votes

What's the difference between term rewriting and pattern matching?

answered Apr 26, 2011 at 12:30

11 votes

Functions that typed lambda calculus cannot compute

answered Jan 10, 2012 at 15:19

11 votes

What do we know about restricted versions of the halting problem

answered Nov 9, 2010 at 16:29

9 votes

What are the relationships between Functional Reactive Programming, Automatic Differentiation, Self-Adjusting Computation and Partial Evaluation?

answered Dec 6, 2011 at 13:52

9 votes

Accepted

Unification-based elimination rule for equality

answered May 4, 2012 at 12:16

9 votes

Commutative operators in unification

answered Jul 25, 2012 at 0:51

9 votes

Closed term and alpha-conversion

answered Nov 12, 2011 at 15:09

8 votes

Accepted

Logic Programming: Transforming B:-A C:-A to B,C:-A

answered Dec 7, 2010 at 0:33

7 votes

When a process spawns another process

answered Nov 8, 2010 at 16:09

7 votes

Accepted

Database query languages for efficient queries

answered May 2, 2011 at 13:19

6 votes

Accepted

Example problems with polynomial and exponential solutions, and tiny footprint?

answered Jun 26, 2011 at 11:15

6 votes

Chomsky normal form method: CYK parser performance implications?

answered Jun 26, 2011 at 11:58

5 votes

Accepted

A question in constraint based analysis

answered Sep 26, 2011 at 13:58

5 votes

Accepted

Characterizing closure under expansion/reduction for big-step semantics?

answered Jul 31, 2012 at 12:10

0 votes

In what manner and to which degree would programming on a hypothetical ternary computer differ than from binary computers?

answered Nov 25, 2011 at 15:29

Stack Exchange Network

20 Answers

Automated theorem proving in linear logic

What is the most powerful kind of parser?

Type inference for imperative statements other than assignment

How to make the Lambda Calculus strong normalizing without a type system?

Curriculum: Logical/Formal Methods in Security

What's the difference between term rewriting and pattern matching?

Functions that typed lambda calculus cannot compute

What do we know about restricted versions of the halting problem

What are the relationships between Functional Reactive Programming, Automatic Differentiation, Self-Adjusting Computation and Partial Evaluation?

Unification-based elimination rule for equality

Commutative operators in unification

Closed term and alpha-conversion

Logic Programming: Transforming B:-A C:-A to B,C:-A

When a process spawns another process

Database query languages for efficient queries

Example problems with polynomial and exponential solutions, and tiny footprint?

Chomsky normal form method: CYK parser performance implications?

A question in constraint based analysis

Characterizing closure under expansion/reduction for big-step semantics?

In what manner and to which degree would programming on a hypothetical ternary computer differ than from binary computers?