2 papers
cs.PL2021
Automating the Functional Correspondence between Higher-Order Evaluators and Abstract Machines
Maciej Buszka, Dariusz Biernacki
The functional correspondence is a manual derivation technique transforming higher-order evaluators into the semantically equivalent abstract machines. The transformation consists…
cs.PL2020
An Abstract Machine for Strong Call by Value
Małgorzata Biernacka, Dariusz Biernacki, Witold Charatonik +1
We present an abstract machine that implements a full-reducing (a.k.a. strong) call-by-value strategy for pure -calculus. It is derived using Danvy et al.'s functional correspon…