A Rational Deconstruction of Landin’s SECD Machine
From MaRDI portal
Publication:5423543
DOI10.1007/11431664_4zbMath1119.68330OpenAlexW1589945454MaRDI 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
Related Items (8)
A functional correspondence between call-by-need evaluators and lazy abstract machines ⋮ The Peter Landin prize ⋮ A syntactic correspondence between context-sensitive calculi and abstract machines ⋮ Refunctionalization at work ⋮ A static simulation of dynamic delimited control ⋮ Inter-deriving semantic artifacts for object-oriented programming ⋮ From Reduction-Based to Reduction-Free Normalization ⋮ A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
This page was built for publication: A Rational Deconstruction of Landin’s SECD Machine
