An abstract framework for environment machines

DOI10.1016/0304-3975(91)90230-YzbMATH Open0727.68033MaRDI QIDQ804281FDOQ804281

Pierre-Louis Curien

Publication date: 1991

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

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

zbMATH Keywords

\(\lambda \) -calculusenvironment machines

Mathematics Subject Classification ID

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Mechanical Evaluation of Expressions
• Full abstraction in the lazy lambda calculus
• Explicit substitutions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinators and functional programming languages. Thirteenth Spring School of the LITP, Val d'Ajol, France, May 6-10, 1985. Proceedings
• The categorical abstract machine
• A Rewriting System for Categorical Combinators with Multiple Arguments
• Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL

Cited In (24)

• On explicit substitutions and names (extended abstract)
• New Developments in Environment Machines
• Inter-deriving semantic artifacts for object-oriented programming
• State-transition machines, revisited
• Title not available (Why is that?)
• Categorical abstract machines for higher-order typed \(\lambda\)-calculi
• 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
• λν, a calculus of explicit substitutions which preserves strong normalisation
• On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
• Inductive families
• A concrete framework for environment machines
• 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
• The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus
• Inter-deriving Semantic Artifacts for Object-Oriented Programming
• Abstract machines, optimal reduction, and streams
• CINNI -- a generic calculus of explicit substitutions and its application to \(\lambda\)-, \(\sigma\)- and \(\pi\)-calculi
• From Reduction-Based to Reduction-Free Normalization

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)