user avatar
user avatar
user avatar
Dominic Mulligan
  • Member for 11 years, 9 months
  • Last seen more than 1 year ago
26 votes

Major unsolved problems in theoretical computer science?

15 votes

How do 'tactics' work in proof assistants?

13 votes

Are there any counterintuitive results in theoretical computer science?

13 votes

Powerful Algorithms too complex to implement

12 votes

Small steps for better TCS conferences?

12 votes

Where and how did computers help prove a theorem?

8 votes

What are possible implementations of Haskell's type classes and what are their (dis)advantages?

7 votes

Using lambda calculus to derive time complexity?

7 votes

Does the order of declarations in an inductive type matter?

6 votes

How would I go about learning the underlying theory of the Coq proof assistant?

6 votes

Examples of "Unrelated" Mathematics Playing a Fundamental Role in TCS?

4 votes

Purely Functional Equivalent of B-Tree?

4 votes
Accepted

What is schema theory within Genetic Algorithms

4 votes

Proving running time upper bounds for algorithms in dependent type theory

3 votes

Type inference for imperative statements other than assignment

3 votes

finding constantness of a term

3 votes

What is the state of the art in theory of "Software transformations preserving behavior"?

3 votes

Tool for specifying operational semantics for given formally specified programming language

3 votes

Type systems preventing laziness-related memory leaks?

2 votes

Monitoring PhD positions in TCS