A concrete framework for environment machines

DOI10.1145/1297658.1297664zbMath1367.68093OpenAlexW2163285555MaRDI QIDQ5277795

Olivier Danvy, Małgorzata Biernacka

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1297658.1297664

zbMATH Keywords

derivationexplicit substitutionsclosuresabstract machines

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (9)

Systematic abstraction of abstract machines ⋮ From Outermost Reduction Semantics to Abstract Machine ⋮ Computational Complexity Via Finite Types ⋮ Inter-deriving Semantic Artifacts for Object-Oriented Programming ⋮ On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion ⋮ Inter-deriving semantic artifacts for object-oriented programming ⋮ The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus ⋮ A correspondence between type checking via reduction and type checking via evaluation ⋮ From Reduction-Based to Reduction-Free Normalization

This page was built for publication: A concrete framework for environment machines