Theoretical Computer Science
user avatar
user avatar
user avatar
Russell O'Connor
  • Member for 11 years, 5 months
  • Last seen more than 4 years ago
  • Kitchener ON
Profile Activity
Stats
618
reputation
2k
reached
1
answer
3
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
4
silver badges
7
bronze badges
Top tags
View all tags
0
Score
2
Posts
50
Posts %
0
Score
2
Posts
50
Posts %
0
Score
2
Posts
50
Posts %
0
Score
1
Posts
25
Posts %
0
Score
1
Posts
25
Posts %
0
Score
1
Posts
25
Posts %
Top posts
All Questions Answers
Score Newest
question
29
Inductive types for large countable ordinal notations.
May 8, 2011
question
14
Is eta-equivalence for functions compatiable with Haskell's seq operation?
Sep 27, 2013
question
9
How can you build a coinductive memoization table for recursive functions over binary trees?
Apr 20, 2018
answer
0
How can you build a coinductive memoization table for recursive functions over binary trees?
May 15, 2018
Top network posts
View all network posts
239
Proofs without words
105
Why does Haskell's `head` crash on an empty list (or why *doesn't* it return an empty list)? (Language philosophy)
50
What is the Store comonad?
34
Critique of the IO monad being viewed as a state monad operating on the world
27
Is the Riemann Hypothesis equivalent to a $\Pi_1$ sentence?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.