An abstract framework for environment machines
type: Item
instance of: scholarly article
title: An abstract framework for environment machines
zbMATH Open document ID: 0727.68033
DOI: 10.1016/0304-3975(91)90230-Y
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
review text: This paper developes a calculus of classes, i.e. a formalism to handle \(\lambda\)-terms with substitutions. It is shown that machines with environment (Krivine's machine and the CAM) essentially corresponds to different strategies for normalizing closures (call by name, call by value). Simple typed closures are also considered and a categorical point of view is sketched.
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4201608
zbMATH Keywords: environment machines
zbMATH Keywords: \(\lambda \) -calculus
author: Pierre-Louis Curien
reviewed by: Yuichi Komori
MaRDI profile type: Publication
cites work: Explicit substitutions
cites work: Full abstraction in the lazy lambda calculus
cites work: Q5667469
cites work: Combinators and functional programming languages. Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings
cites work: The categorical abstract machine
cites work: Q3785893
cites work: Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
cites work: Q4029341
cites work: Q5595187
cites work: Q4735315
cites work: Q3727946
cites work: The Mechanical Evaluation of Expressions
cites work: Q3659756
cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus
cites work: A Rewriting System for Categorical Combinators with Multiple Arguments
description: scientific article; zbMATH DE number 4201608