Lambda Calculus for Engineers


Hartel, P.H. and Vree, W.G. (2007) Lambda Calculus for Engineers. In: E. Barendsen & V. Capretta & H. Geuvers & M. Niqui (Eds.), Reflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday. Radboud University, Nijmegen, pp. 125-138. ISBN 9789090224466

open access
Abstract:In pure functional programming it is awkward to use a stateful sub-computation in a predominantly stateless computation. The problem is that the state of the subcomputation has to be passed around using ugly plumbing. Classical examples of the plumbing problem are: providing a supply of fresh names, and providing a supply of random numbers. We propose to use (deterministic) inductive definitions rather than recursion equations as a basic paradigm and show how this makes it easier to add the plumbing.
Item Type:Book Section
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 245831