5 citations · 12 across the 9 of their papers we have counts for
6 papers · 1 filter
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…
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…
Expansion for Universal Quantifiers
Sergueï Lenglet, J. B. Wells
Expansion is an operation on typings (i.e., pairs of typing environments and result types) defined originally in type systems for the lambda-calculus with intersection types in ord…
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…