A call-by-name lambda-calculus machine
- 25 October 2007
- journal article
- Published by Springer Nature in Higher-Order and Symbolic Computation
- Vol. 20 (3) , 199-207
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A syntactic correspondence between context-sensitive calculi and abstract machinesTheoretical Computer Science, 2007
- Dependent choice, ‘quote’ and the clockTheoretical Computer Science, 2003
- Typed lambda-calculus in classical Zermelo-Frænkel set theoryArchive for Mathematical Logic, 2001
- Disjunctive Tautologies as Synchronisation Schemes2000
- A formulae-as-type notion of control1990
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972
- The Mechanical Evaluation of ExpressionsThe Computer Journal, 1964