Implement in Haskell the Church encoding of the pair for polymorphic λ-calculus/System F...

Is it possible to define Omega combinator (λx.xx) in modern Haskell?...

Ruby and Lambda calculus...

Y-Combinator definiton...

Add4 Using Lambda Expression...

Is there any efficient way to convert an unary number to a binary number?...

EVAL: undefined function NIL in Lisp...

Is it usual for interaction nets to leave piles of redundant fans?...

Is it possible to infer the normalized source of a pure λ function on Haskell?...

How can you recover the source code from a pure JavaScript function?...

Recursion for church numerals in scheme...

How to use AND in Oz Programming language...

What are the state-of-art methods for solving functional equations?...

Eliminate lambda in Scheme?...

Finding out lambda calculus/haskell type of some example...

Access outer variable inside a block and Y-combinator...

Calling/applying lambda vs. function call - the syntax in Ruby is different. Why?...

Why won't GHC reduce my type family?...

Correct form of letrec in Hindley-Milner type system?...

Convert natural language into logical formula...

Haskell - polymorphism and values depending on types...

How do you represent nested types using the Scott Encoding?...

What is the right way to typecheck dependent lambda abstraction using 'bound'?...

Is it possible to showcase the different strategies of evaluation by modifying this simple reducer?...

Expanding Recursive Functions In Coq...

Is it possible to implement a function that returns an n-tuple on the lambda calculus?...

Obtaining the predicates in a Lambda Calculus Expression...

Rotate the first argument to a function to become nth...

How to manually manipulate precedence of special expressions in Parsec?...

Difference between call-by-value and call-by-name interpreter for the lambda calculus...