Theoretical Computer Science
Meta user
Network profile
807
reputation
9
15

Dominic Mulligan

Senior Formal Verification Reasearcher at Arm Research, Cambridge. Previously a postdoc at the University of Cambridge and the University of Bologna.

20
answers
0
questions
~131k
people reached
  • Cambridge, United Kingdom
  • dominic-mulligan.co.uk
  • Member for 8 years, 11 months
  • 156 profile views
  • Last seen Jul 19 at 21:13

Communities (7)

Top network posts

We respect a laser-like focus on one topic.

Top tags (35)

Score 35
Posts 6
Posts % 30
Score 30
Posts 5
Score 24
Posts 5
Score 22
Posts 3
Score 16
Posts 3
Score 12
Posts 2
View all tags →

Top posts (20) All Questions Answers | Votes Newest

26 Major unsolved problems in theoretical computer science? Aug 24 '10
13 Are there any counterintuitive results in theoretical computer science? Nov 25 '10
12 Powerful Algorithms too complex to implement Jan 24 '11
12 How do 'tactics' work in proof assistants? Oct 7 '11
11 Small steps for better TCS conferences? May 17 '11
11 Where and how did computers help prove a theorem? Aug 23 '10
8 What are possible implementations of Haskell's type classes and what are their (dis)advantages? Nov 26 '12
7 Using lambda calculus to derive time complexity? Aug 23 '10
6 Does the order of declarations in an inductive type matter? Oct 5 '11
6 How would I go about learning the underlying theory of the Coq proof assistant? Oct 5 '11
View all questions and answers →

Badges (24)

Gold

—

Silver

9

Rarest

Bronze

15

Rarest

View all badges →