The bologna optimal higher-order machine
- 1 January 1996
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 6 (6) , 763-810
- https://doi.org/10.1017/s0956796800001994
Abstract
The Bologna Optimal Higher-order Machine (BOHM) is a prototype implementation of the core of a functional language based on (a variant of) Lamping's optimal graph reduction technique (Lamping, 1990; Gonthier et al., 1992a; Asperti, 1994). The source language is a sugared λ-calculus enriched with booleans, integers, lists and basic operations on these data types (following the guidelines of Interaction Systems – Asperti and Laneve (1993b, 1994), Laneve (1993)). In this paper, we shall describe BOHM's general architecture (comprising the garbage collector), and give a large set of benchmarks and experimental results.Keywords
This publication has 5 references indexed in Scilit:
- Interaction Systems I: The theory of optimal reductionsMathematical Structures in Computer Science, 1994
- The geometry of optimal lambda reductionPublished by Association for Computing Machinery (ACM) ,1992
- On laziness and optimality in lambda interpreters: tools for specification and analysisPublished by Association for Computing Machinery (ACM) ,1990
- An algorithm for optimal lambda calculus reductionPublished by Association for Computing Machinery (ACM) ,1990
- Linear logicTheoretical Computer Science, 1987