Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Lambda Calculus
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Gérard_Huet <Gerard.Huet@i...>
Subject: [Caml-list] Lambda Calculus
Everything you wanted to know about lambda-calculus - but were afraid 
to ask.
Nicely packaged as a set of executable Ocaml modules in limpid Pidgin 
ML syntax.

Learn how to program in pure lambda calculus the slowest quicksort in 
the world:

# let _L=list[3;2;5;1] in normal_list<<(^Quicksort ^L)>>;
- : list int = [1; 2; 3; 5]

Freak out with the Böhm-out technique and amaze your local theory guru 
by challenging him to separate Quicksort and Factorial:

# bohm(_Quicksort,_Fact);
- : list Term.term = [[x0,x1,x2,x3,x4]x3; [x0,x1]x0; [x0,x1]x0; [x0]x0]

Learn Recursion theory in one easy lesson, and surprise your friends by 
revealing that
Kleene is Church composed with Gödel :

value kleene t = church (godel t);

Win fortunes at TV Quiz shows by computing Gödel numbers faster than 

# godel _Fix = 6941718342796165477078794502929179108365127687513804648;
- : bool = True

All this and more in the Constructive Computation Theory course, 
available in the Ocaml Hump:

or directly at:


To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: