31 citations · 35 across the 5 of their papers we have counts for
6 papers
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…
Fully Abstract Encodings of -Calculus in HOcore through Abstract Machines
Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet +3
We present fully abstract encodings of the call-by-name and call-by-value -calculus into HOcore, a minimal higher-order process calculus with no name restriction. We consider se…
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…
Proving termination of evaluation for System F with control operators
Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet +1
We present new proofs of termination of evaluation in reduction semantics (i.e., a small-step operational semantics with explicit representation of evaluation contexts) for System…
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
We present an abstract machine and a reduction semantics for the lambda-calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. T…