31 citations · 39 across the 11 of their papers we have counts for
4 papers · 1 filter
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…
Bisimulations for Delimited-Control Operators
Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
We present a comprehensive study of the behavioral theory of an untyped -calculus extended with the delimited-control operators shift and reset. To that end, we define a context…
Proving Soundness of Extensional Normal-Form Bisimilarities
Dariusz Biernacki, Serguei Lenglet, Piotr Polesiuk
Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence that relates terms in -calculi by decomposing their normal forms into bisimilar subterms. Moreover, it t…
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…