Lambda Calculus for Engineers

Pieter H. Hartel, W.G. Vree

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    102 Downloads (Pure)


    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.
    Original languageUndefined
    Title of host publicationReflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday
    EditorsE. Barendsen, V. Capretta, H. Geuvers, M. Niqui
    Place of PublicationNijmegen
    PublisherRadboud University
    Number of pages14
    ISBN (Print)978-90-9022446-6
    Publication statusPublished - 17 Dec 2007

    Publication series

    PublisherRadboud University


    • SCS-Cybersecurity
    • METIS-245831
    • EWI-11509
    • IR-64508

    Cite this