Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Biernacka, Małgorzata"'
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
The invariance thesis of Slot and van Emde Boas states that all reasonable models of computation simulate each other with polynomially bounded overhead in time and constant-factor overhead in space. In this paper we show that a family of strong call-
Externí odkaz:
http://arxiv.org/abs/2102.05985
We present an abstract machine that implements a full-reducing (a.k.a. strong) call-by-value strategy for pure $\lambda$-calculus. It is derived using Danvy et al.'s functional correspondence from Cr\'egut's KN by: (1) deconstructing KN to a call-by-
Externí odkaz:
http://arxiv.org/abs/2009.06984
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:
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
Publikováno v:
Logical Methods in Computer Science, Volume 1, Issue 2 (November 8, 2005) lmcs:2269
We present an abstract machine and a reduction semantics for the lambda-calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. The abstract machine is derived from an evaluator in continuation-passi
Externí odkaz:
http://arxiv.org/abs/cs/0508048
Publikováno v:
[Research Report] RR-9475, Inria. 2022, pp.1-33
CONCUR 2022-33rd International Conference on Concurrency Theory
CONCUR 2022-33rd International Conference on Concurrency Theory, Sep 2022, Varsovie, Poland. pp.1-24, ⟨10.4230/LIPIcs.CONCUR.2022.7⟩
CONCUR 2022-33rd International Conference on Concurrency Theory
CONCUR 2022-33rd International Conference on Concurrency Theory, Sep 2022, Varsovie, Poland. pp.1-24, ⟨10.4230/LIPIcs.CONCUR.2022.7⟩
We present a generic design of abstract machines for nondeterministic programming languages, such as process calculi or concurrent lambda calculi, that provides a simple way to implement them. Such a machine traverses a term in the search for a redex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7af8b5deecd8cde1d1dbe9279542cc40
https://inria.hal.science/hal-03545768v2/document
https://inria.hal.science/hal-03545768v2/document
We present a generic framework for the specification and reasoning about reduction strategies in the lambda calculus, representable as sets of term decompositions. It is provided as a Coq formalization that features a novel format of phased strategie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27d6c173cc3b194af736c8fb314f9cb0
Autor:
Biernacka, Małgorzata
Publikováno v:
Dagerotyp / Daguerreotype. (13):40-53
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=272941