### Abstract

Original language | Undefined |
---|---|

Title of host publication | Reflections on Type Theory, Lambda Calculus, and the Mind: Essays Dedicated to Henk Barendregt on the Occasion of his 60th Birthday |

Editors | E. Barendsen, V. Capretta, H. Geuvers, M. Niqui |

Place of Publication | Nijmegen |

Publisher | Radboud University |

Pages | 125-138 |

Number of pages | 14 |

ISBN (Print) | 978-90-9022446-6 |

Publication status | Published - 17 Dec 2007 |

### Publication series

Name | |
---|---|

Publisher | Radboud University |

Number | Supplement |

### Keywords

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

### Cite this

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

}

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

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

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 -