@inbook{6fe4075e8c3c40d4b253b99925bace8c,

title = "Lambda Calculus for Engineers",

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.",

keywords = "SCS-Cybersecurity, METIS-245831, EWI-11509, IR-64508",

author = "Hartel, {Pieter H.} and W.G. Vree",

year = "2007",

month = dec,

day = "17",

language = "Undefined",

isbn = "978-90-9022446-6",

publisher = "Radboud University",

number = "Supplement",

pages = "125--138",

editor = "E. Barendsen and V. Capretta and H. Geuvers and M. Niqui",

booktitle = "Reflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday",

}