scientific article; zbMATH DE number 7559274

DOI10.4230/LIPICS.FSCD.2019.8MaRDI QIDQ5089007FDOQ5089007

Authors: Małgorzata Biernacka, Witold Charatonik 

Publication date: 18 July 2022

Title of this publication is not available (Why is that?)

zbMATH Keywords

abstract machinesreduction semantics

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• A functional correspondence between call-by-need evaluators and lazy abstract machines
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• The call-by-need lambda calculus
• Deriving a lazy abstract machine
• The call-by-need lambda calculus
• A syntactic correspondence between context-sensitive calculi and abstract machines
• Semantics engineering with PLT Redex
• A new implementation technique for applicative languages
• Lazy evaluation and delimited control
• Strongly reducing variants of the Krivine abstract machine
• A compiled implementation of strong reduction
• Implementing open call-by-value
• On the Relative Usefulness of Fireballs
• A Strong Distillery
• The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus
• Defunctionalized interpreters for call-by-need evaluation
• Title not available (Why is that?)

Cited In (2)

• An abstract machine for strong call by value
• A strong call-by-need calculus

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089007)