Zobrazeno 1 - 10
of 27
pro vyhledávání: '"POLESIUK, PIOTR"'
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
Autor:
Biernacki, Dariusz, Polesiuk, Piotr
Publikováno v:
Logical Methods in Computer Science, Volume 14, Issue 1 (January 30, 2018) lmcs:4180
A coercion semantics of a programming language with subtyping is typically defined on typing derivations rather than on typing judgments. To avoid semantic ambiguity, such a semantics is expected to be coherent, i.e., independent of the typing deriva
Externí odkaz:
http://arxiv.org/abs/1710.09469
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
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
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.
Publikováno v:
In Electronic Notes in Theoretical Computer Science 30 November 2019 347:25-43
Publikováno v:
In Electronic Notes in Theoretical Computer Science 16 April 2018 336:41-56
Publikováno v:
Formal Structures for Computation and Deduction
Formal Structures for Computation and Deduction, Jun 2020, Paris, France. ⟨10.4230/LIPIcs.FSCD.2020.7⟩
Formal Structures for Computation and Deduction, Jun 2020, Paris, France. ⟨10.4230/LIPIcs.FSCD.2020.7⟩
International audience; We present a complete coinductive syntactic theory for an untyped calculus of algebraic operations and handlers, a relatively recent concept that augments a programming language with unprecedented flexibility to define, combin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e2afc8d4390c61619988d7272d1be112
https://hal.inria.fr/hal-02559253
https://hal.inria.fr/hal-02559253