40 citations · 142 across the 19 of their papers we have counts for
16 papers · 1 filter
Higher Catoids, Higher Quantales and their Correspondences
Cameron Calk, Philippe Malbos, Damien Pous +1
We introduce -catoids as generalisations of (strict) -categories and in particular the higher path categories generated by computads or polygraphs in higher-dimensional rewri…
Fully Abstract Encodings of -Calculus in HOcore through Abstract Machines
Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet +3
We present fully abstract encodings of the call-by-name and call-by-value -calculus into HOcore, a minimal higher-order process calculus with no name restriction. We consider se…
Modular coinduction up-to for higher-order languages via first-order transition systems
Jean-Marie Madiot, Damien Pous, Davide Sangiorgi
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., C…
Companions, Causality and Codensity
Damien Pous, Jurriaan Rot
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 l…
Petri Automata
Paul Brunet, Damien Pous
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 i…
Hilbert-Post completeness for the state and the exception effects
Jean-Guillaume Dumas, Dominique Duval, Burak Ekici +2
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 eff…