A Rational Deconstruction of Landin’s SECD Machine
From MaRDI portal
Publication:5423543
DOI10.1007/11431664_4zbMath1119.68330MaRDI QIDQ5423543
Publication date: 23 October 2007
Published in: Implementation and Application of Functional Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11431664_4
68N18: Functional programming and lambda calculus
Related Items
The Peter Landin prize, A syntactic correspondence between context-sensitive calculi and abstract machines, Refunctionalization at work, Inter-deriving semantic artifacts for object-oriented programming, A functional correspondence between call-by-need evaluators and lazy abstract machines, A static simulation of dynamic delimited control, A functional correspondence between monadic evaluators and abstract machines for languages with computational effects, From Reduction-Based to Reduction-Free Normalization