32 citations · 40 across the 6 of their papers we have counts for
3 papers · 1 filter
A simple and efficient implementation of strong call by need by an abstract machine
Małgorzata Biernacka, Witold Charatonik, Tomasz Drab
Strong call-by-need combines full normalization with the sharing discipline of lazy evaluation, yet no prior implementation achieved both simplicity and efficiency. We introduce RK…
Strong Call by Value is Reasonable for Time
Małgorzata Biernacka, Witold Charatonik, Tomasz Drab
The invariance thesis of Slot and van Emde Boas states that all reasonable models of computation simulate each other with polynomially bounded overhead in time and constant-factor…
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…