Lambda Calculus for Engineers

Pieter H. Hartel, W.G. Vree

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    32 Downloads (Pure)

    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.
    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
    Pages125-138
    Number of pages14
    ISBN (Print)978-90-9022446-6
    Publication statusPublished - 17 Dec 2007

    Publication series

    Name
    PublisherRadboud University
    NumberSupplement

    Keywords

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

    Cite this

    Hartel, P. H., & 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 (pp. 125-138). Nijmegen: Radboud University.
    Hartel, Pieter H. ; Vree, W.G. / Lambda Calculus for Engineers. Reflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday. editor / E. Barendsen ; V. Capretta ; H. Geuvers ; M. Niqui. Nijmegen : Radboud University, 2007. pp. 125-138
    @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 = "12",
    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",

    }

    Hartel, PH & Vree, WG 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.

    Lambda Calculus for Engineers. / Hartel, Pieter H.; Vree, W.G.

    Reflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday. ed. / E. Barendsen; V. Capretta; H. Geuvers; M. Niqui. Nijmegen : Radboud University, 2007. p. 125-138.

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    TY - CHAP

    T1 - Lambda Calculus for Engineers

    AU - Hartel, Pieter H.

    AU - Vree, W.G.

    PY - 2007/12/17

    Y1 - 2007/12/17

    N2 - 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.

    AB - 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.

    KW - SCS-Cybersecurity

    KW - METIS-245831

    KW - EWI-11509

    KW - IR-64508

    M3 - Chapter

    SN - 978-90-9022446-6

    SP - 125

    EP - 138

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

    A2 - Barendsen, E.

    A2 - Capretta, V.

    A2 - Geuvers, H.

    A2 - Niqui, M.

    PB - Radboud University

    CY - Nijmegen

    ER -

    Hartel PH, Vree WG. Lambda Calculus for Engineers. In Barendsen E, Capretta V, Geuvers H, Niqui M, editors, Reflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday. Nijmegen: Radboud University. 2007. p. 125-138