scientific article; zbMATH DE number 7559274

DOI10.4230/LIPIcs.FSCD.2019.8MaRDI QIDQ5089007

Małgorzata Biernacka, Witold Charatonik

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reduction semanticsabstract machines

Mathematics Subject Classification ID

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

Related Items (1)

A strong call-by-need calculus

Cites Work

• A syntactic correspondence between context-sensitive calculi and abstract machines
• Implementing open call-by-value
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• Strongly reducing variants of the Krivine abstract machine
• The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus
• A compiled implementation of strong reduction
• A Strong Distillery
• Defunctionalized Interpreters for Call-by-Need Evaluation
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• A new implementation technique for applicative languages
• The call-by-need lambda calculus
• Deriving a lazy abstract machine
• The call-by-need lambda calculus
• On the Relative Usefulness of Fireballs
• Lazy evaluation and delimited control
• Unnamed Item
• Unnamed Item

This page was built for publication: