Search

• < Previous
• 1
• Next >

---

Untyping Typed Algebras and Colouring Cyclic Linear Logic

Damien Pous.

We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the corresponding untyped decision procedures can be extended for free to&nbsp;[&hellip;]

---

Deciding Kleene Algebras in Coq

Thomas Braibant ; Damien Pous.

We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations instantaneously and properly scales to larger expressions. The&nbsp;[&hellip;]

---

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 if they are universally equivalent in the model of binary relations. We consider Kleene allegories, i.e., Kleene algebras&nbsp;[&hellip;]

---

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 largest compatible function, called the companion, subsumes most enhancements and has been proved to enjoy many good&nbsp;[&hellip;]

---

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., CCS-like) labelled transition systems (LTSs) and bisimilarity, based on abstract fixed-point theory and compatible&nbsp;[&hellip;]

---