31 citations · 39 across the 11 of their papers we have counts for
8 papers · 1 filter
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…
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…
Logical relations for coherence of effect subtyping
Dariusz Biernacki, Piotr Polesiuk
A coercion semantics of a programming language with subtyping is typically defined on typing derivations rather than on typing judgments. To avoid semantic ambiguity, such a semant…
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation
Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet +1
We present sound and complete environmental bisimilarities for a variant of Dybvig et al.'s calculus of multi-prompted delimited-control operators with dynamic prompt generation. T…
Environmental Bisimulations for Delimited-Control Operators
Dariusz Biernacki, Sergueï Lenglet
We present a theory of environmental bisimilarity for the delimited-control operators {\it shift} and {\it reset}. We consider two different notions of contextual equivalence: one…
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…
Normal Form Bisimulations for Delimited-Control Operators
Dariusz Biernacki, Serguei Lenglet
We define a notion of normal form bisimilarity for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. Normal form bisimilariti…
Applicative Bisimulations for Delimited-Control Operators
Dariusz Biernacki, Serguei Lenglet
We develop a behavioral theory for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. For this calculus, we discuss the possib…