Functional runtime systems within the lambda-sigma calculus
From MaRDI portal
Publication:4236754
DOI10.1017/S0956796898002986zbMath0918.03018OpenAlexW2160740215MaRDI QIDQ4236754
Luc Maranget, Bruno Pagano, Thérèse Hardin
Publication date: 17 August 1999
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796898002986
abstract machinesKrivine machineruntime systemsCAMFAMfunctional compilersSECDweak \(\lambda\)-calculus
Theory of compilers and interpreters (68N20) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Related Items
A functional correspondence between call-by-need evaluators and lazy abstract machines, A syntactic correspondence between context-sensitive calculi and abstract machines, Explaining the lazy Krivine machine using explicit substitution and addresses, Strongly reducing variants of the Krivine abstract machine, Comparing Calculi of Explicit Substitutions with Eta-reduction, Inter-deriving semantic artifacts for object-oriented programming, Lambda-calculus with director strings, Comparing and implementing calculi of explicit substitutions with eta-reduction, Unnamed Item, Coinductive big-step operational semantics, From Reduction-Based to Reduction-Free Normalization
