Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Lenglet, Sergueï"'
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
Autor:
BIERNACKA, MAŁGORZATA, BIERNACKI, DARIUSZ, LENGLET, SERGUEÏ, POLESIUK, PIOTR, POUS, DAMIEN, SCHMITT, ALAN
Publikováno v:
Logical Methods in Computer Science (LMCS); 2024, Vol. 20 Issue 3, p3:1-3:45, 45p
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:
Lenglet, Sergueï
Les calculs de processus représentent les systèmes concurrents par des processus qui s'exécutent en parallèle et s'échangent des messages. Les calculs avec passivation dispose d'un opérateur spécial qui permet de stopper un processus en cours
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00447857
http://tel.archives-ouvertes.fr/docs/00/44/78/57/PDF/these.pdf
http://tel.archives-ouvertes.fr/docs/00/44/78/57/PDF/these.pdf
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