Deriving a lazy abstract machine
From MaRDI portal
Publication:4358457
DOI10.1017/S0956796897002712zbMath0881.68049OpenAlexW2103859677MaRDI QIDQ4358457
Publication date: 29 September 1997
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796897002712
Related Items
Semantics of value recursion for Monadic Input/Output, The Negligible and Yet Subtle Cost of Pattern Matching, The Role of Indirections in Lazy Natural Semantics, From natural semantics to C: A formal derivation of two STG machines, A functional correspondence between call-by-need evaluators and lazy abstract machines, Type-based cost analysis for lazy functional languages, On the value of variables, Unnamed Item, The adequacy of Launchbury's natural semantics for lazy evaluation, A syntactic correspondence between context-sensitive calculi and abstract machines, Trends in trends in functional programming 1999/2000 versus 2007/2008, On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation, A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation, Calculating correct compilers, Modular, higher order cardinality analysis in theory and practice, Operational semantics for declarative multi-paradigm languages, Explaining the lazy Krivine machine using explicit substitution and addresses, Improving the lazy Krivine machine, The next 700 Krivine machines, Proving correctness of a compiler using step-indexed logical relations, The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving, Demonstrating Lambda Calculus Reduction, Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion, Unnamed Item, The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus, A Fresh Look at the λ-Calculus, A Resource-Aware Semantics and Abstract Machine for a Functional Language with Explicit Deallocation, Small-step and big-step semantics for call-by-need
