Skip to Main content Skip to Navigation
Conference papers

A formal exploration of Nominal Kleene Algebra

Paul Brunet 1, 2 Damien Pous 1, 2
2 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : An axiomatisation of Nominal Kleene Algebra has been proposed by Gabbay and Ciancia, and then shown to be complete and decidable by Kozen et al. However, one can think of at least four different formulations for a Kleene Algebra with names: using freshness conditions or a presheaf structure (types), and with explicit permutations or not. We formally show that these variations are all equivalent. Then we introduce an extension of Nominal Kleene Algebra, motivated by relational models of programming languages. The idea is to let letters (i.e., atomic programs) carry a set of names, rather than being reduced to a single name. We formally show that this extension is at least as expressive as the original one, and that it may be presented with or without a presheaf structure, and with or without syntactic permutations. Whether this extension is strictly more expressive remains open. All our results were formally checked using the Coq proof assistant.
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download
Contributor : Damien Pous <>
Submitted on : Tuesday, July 11, 2017 - 12:10:54 PM
Last modification on : Tuesday, November 19, 2019 - 2:43:57 AM
Document(s) archivé(s) le : Wednesday, January 24, 2018 - 7:57:11 PM


Files produced by the author(s)




Paul Brunet, Damien Pous. A formal exploration of Nominal Kleene Algebra. MFCS, Aug 2016, Cracovie, Poland. ⟨10.4230/LIPIcs.MFCS.2016.22⟩. ⟨hal-01307532v2⟩



Record views


Files downloads