Skip to main content

Stochastic λ-Calculus

Dana Scott
It is shown how the operators in the "graph model" for λ-calculus (which can function as a programming language for Recursive Function Theory) can be expanded to allow for "random combinators". The result then is a semantics for a new language for random algorithms. The author wants to make a plea for finding applications.

Slides and notes available at (Let me know if you have access problems.)

Share this: