An abstract machine for strong call by value

DOI10.1007/978-3-030-64437-6_8zbMath1476.68047arXiv2009.06984OpenAlexW3107124382MaRDI QIDQ2038078

Małgorzata Biernacka, Dariusz Biernacki, Tomasz Drab, Witold Charatonik

Publication date: 8 July 2021

Full work available at URL: https://arxiv.org/abs/2009.06984

zbMATH Keywords

\(\lambda\)-calculusreduction semanticsnormalization by evaluationabstract machinesreduction strategies

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

Automating the functional correspondence between higher-order evaluators and abstract machines ⋮ A strong call-by-need calculus

This page was built for publication: An abstract machine for strong call by value