Zobrazeno 1 - 10
of 141
pro vyhledávání: '"Pous, Damien"'
We provide a finite equational presentation of graphs of treewidth at most three, solving an instanceof an open problem by Courcelle and Engelfriet.We use a syntax generalising series-parallel expressions, denoting graphs with a small interface.We in
Externí odkaz:
http://arxiv.org/abs/2411.18176
This article is part of a programme on the formalisation of higher categories and the categorification of rewriting theory. Set-valued structures such as catoids are used in this context to formalise local categorical composition operations. We intro
Externí odkaz:
http://arxiv.org/abs/2307.09253
Autor:
Pous, Damien, Wagemaker, Jana
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 3 (September 30, 2024) lmcs:11198
We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of Kleene algeb
Externí odkaz:
http://arxiv.org/abs/2304.07190
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 2 (May 16, 2024) lmcs:10197
In the literature on Kleene algebra, a number of variants have been proposed which impose additional structure specified by a theory, such as Kleene algebra with tests (KAT) and the recent Kleene algebra with observations (KAO), or make specific assu
Externí odkaz:
http://arxiv.org/abs/2210.13020
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 17, Issue 3 (September 17, 2021) lmcs:6046
The bisimulation proof method can be enhanced by employing `bisimulations up-to' techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) and bisimilarity, based on
Externí odkaz:
http://arxiv.org/abs/2001.07063
Autor:
Pous, Damien, Rot, Jurriaan
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 3 (August 8, 2019) lmcs:4166
In the context of abstract coinduction in complete lattices, the notion of compatible function makes it possible to introduce enhancements of the coinduction proof principle. The largest compatible function, called the companion, subsumes most enhanc
Externí odkaz:
http://arxiv.org/abs/1712.08526
Autor:
Brunet, Paul, Pous, Damien
Publikováno v:
Logical Methods in Computer Science, Volume 13, Issue 3 (September 26, 2017) lmcs:3125
Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary relations. We
Externí odkaz:
http://arxiv.org/abs/1702.01804
In this paper, we present a novel framework for studying the syntactic completeness of computational effects and we apply it to the exception effect. When applied to the states effect, our framework can be seen as a generalization of Pretnar's work o
Externí odkaz:
http://arxiv.org/abs/1503.00948
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
