2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.PL2021★ 2 cited
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…
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…