4 papers
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…
Faithful (meta-)encodings of programmable strategies into term rewriting systems
Horatiu Cirstea, Serguei Lenglet, Pierre-Etienne Moreau
Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transfor…