Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Lenglet, Serguei"'
Autor:
Biernacka, Małgorzata, Biernacki, Dariusz, Lenglet, Sergueï, Polesiuk, Piotr, Pous, Damien, Schmitt, Alan
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 3 (July 3, 2024) lmcs:9565
We present fully abstract encodings of the call-by-name and call-by-value $\lambda$-calculus into HOcore, a minimal higher-order process calculus with no name restriction. We consider several equivalences on the $\lambda$-calculus side -- normal-form
Externí odkaz:
http://arxiv.org/abs/2205.06665
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 2 (May 24, 2019) lmcs:4458
We present a comprehensive study of the behavioral theory of an untyped $\lambda$-calculus extended with the delimited-control operators shift and reset. To that end, we define a contextual equivalence for this calculus, that we then aim to character
Externí odkaz:
http://arxiv.org/abs/1804.08373
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 1 (March 29, 2019) lmcs:4041
Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence that relates terms in $\lambda$-calculi by decomposing their normal forms into bisimilar subterms. Moreover, it typically allows for powerful up-to techniques, such as bisimulat
Externí odkaz:
http://arxiv.org/abs/1711.00113
Publikováno v:
Logical Methods in Computer Science, Volume 13, Issue 4 (November 28, 2017) lmcs:4096
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 transformations one wants to operate and rewriting strategies are used to con-
Externí odkaz:
http://arxiv.org/abs/1705.08632
Publikováno v:
Logical Methods in Computer Science, Volume 13, Issue 3 (September 19, 2017) lmcs:2563
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. The reasoning principles that we obtain generalize and advance the exis
Externí odkaz:
http://arxiv.org/abs/1611.09626
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Biernacki, Dariusz, Lenglet, Sergueï
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 that does not require the presence of a top-level control delimiter wh
Externí odkaz:
http://arxiv.org/abs/1309.3919
Publikováno v:
EPTCS 127, 2013, pp. 15-29
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 F with control operators. We introduce a modified version of Girard's
Externí odkaz:
http://arxiv.org/abs/1309.1261
Autor:
Biernacki, Dariusz, Lenglet, Serguei
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 bisimilarities are simple, easy-to-use behavioral equivalences which relate terms
Externí odkaz:
http://arxiv.org/abs/1202.5959
Autor:
Lenglet, Sergueï, Wells, J. B.
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 order to obtain principal (i.e., most informative, strongest) typings. In
Externí odkaz:
http://arxiv.org/abs/1201.1101