An abstract framework for environment machines

DOI10.1016/0304-3975(91)90230-YMaRDI QIDQ804281zbMATH OpenFDO

Authors Pierre-Louis Curien

Publication date 1991

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(91)90230-Y

zbMATH Keywords

\(\lambda \) -calculusenvironment machines

Mathematics Subject Classification ID

Recommendations

• A concrete framework for environment machines
• New developments in environment machines
• A categorical understanding of environment machines
• An environment machine for the λμ-calculus
• A syntactic correspondence between context-sensitive calculi and abstract machines

Cites work

• scientific article; zbMATH DE number 3811536 (Why is no real title available?)
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 4048997 (Why is no real title available?)
• scientific article; zbMATH DE number 130889 (Why is no real title available?)
• scientific article; zbMATH DE number 4122189 (Why is no real title available?)
• scientific article; zbMATH DE number 3316072 (Why is no real title available?)
• scientific article; zbMATH DE number 3400430 (Why is no real title available?)
• A Rewriting System for Categorical Combinators with Multiple Arguments
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Combinators and functional programming languages. Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings
• Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
• Explicit substitutions
• Full abstraction in the lazy lambda calculus
• The Mechanical Evaluation of Expressions
• The categorical abstract machine

Cited in

(27)

• On explicit substitutions and names (extended abstract)
• Inter-deriving semantic artifacts for object-oriented programming
• State-transition machines, revisited
• scientific article; zbMATH DE number 1342289 (Why is no real title available?)
• Categorical abstract machines for higher-order typed -calculi
• The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
• Explicit substitutions and higher-order syntax
• Computational Complexity Via Finite Types
• Explaining the lazy Krivine machine using explicit substitution and addresses
• The next 700 Krivine machines
• Simply typed lambda calculus with first-class environments
• A syntactic correspondence between context-sensitive calculi and abstract machines
• On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
• λν, a calculus of explicit substitutions which preserves strong normalisation
• New developments in environment machines
• Inductive families
• Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
• A concrete framework for environment machines
• A Logical Foundation for Environment Classifiers
• Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
• A Logical Foundation for Environment Classifiers
• On explicit substitution with names
• Optimizing a non-deterministic abstract machine with environments
• Inter-deriving Semantic Artifacts for Object-Oriented Programming
• Abstract machines, optimal reduction, and streams
• From reduction-based to reduction-free normalization
• CINNI -- a generic calculus of explicit substitutions and its application to -, - and -calculi

This page was built for publication: An abstract framework for environment machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804281)