user avatar
user avatar
user avatar
Petr
  • Member for 10 years
  • Last seen more than 3 years ago
12 votes
Accepted

Are the $\lambda_I$-Calculus and the $\lambda_K$-Calculus equivalent?

10 votes

Is there a concept of something like co-applicative functors sitting between comonads and functors?

9 votes

How to implement a functional programming language efficiently?

6 votes

What are the relations between Alternative, MonadPlus(LeftCatch) and MonadPlus(LeftDistributive)?

5 votes

Isomorphism between algebraic data-types

5 votes

What are the simplest turing-complete systems?

4 votes

Term that can distinguish beta-equivalent normal forms in the untyped lambda calculus

4 votes

Actual practical example of a prefix-free Turing-complete language

1 vote
Accepted

Does using Normal Order Evaluation instead of Normal Order Reduction lose the Normalization theorem?