Rob Simmons's user avatar
Rob Simmons's user avatar
Rob Simmons's user avatar
Rob Simmons
  • Member for 13 years, 7 months
  • Last seen more than 9 years ago
17 votes
Accepted

Automated theorem proving in linear logic

15 votes

What is the most powerful kind of parser?

14 votes
Accepted

Type inference for imperative statements other than assignment

14 votes

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

12 votes

Curriculum: Logical/Formal Methods in Security

11 votes

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

11 votes

Functions that typed lambda calculus cannot compute

11 votes

What do we know about restricted versions of the halting problem

9 votes

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

9 votes
Accepted

Unification-based elimination rule for equality

9 votes

Commutative operators in unification

9 votes

Closed term and alpha-conversion

8 votes
Accepted

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

7 votes

When a process spawns another process

7 votes
Accepted

Database query languages for efficient queries

6 votes
Accepted

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

6 votes

Chomsky normal form method: CYK parser performance implications?

5 votes
Accepted

A question in constraint based analysis

5 votes
Accepted

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

0 votes

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