Skip to Main content Skip to Navigation

Représentation coinductive des graphes

Abstract : We are interested in graph representation in the theorem prover Coq. We have chosen to represent graphs using coinductive types. We wanted to explore their use in Coq. Indeed, they make the graph representation succinct and elegant. Moreover, navigability is ensured by construction. We had to overcome the guardedness condition whose objective is to ensure validity of all operations made on coinductive objects. Its implementation in Coq is restrictive and sometimes forbids definitions, even semantically correct ones. A canonical formalization of graphs thus surmounts Coq's direct expressivity. We have designed a solution respecting these limitations. Then, we have defined a relation on graphs close to the notion of equivalence obtained on a classical representation, keeping however the advantages offered by coinduction. We show that this relation is equivalent to another one based on finite observations of the graphs.
Complete list of metadata

Cited literature [93 references]  Display  Hide  Download
Contributor : Celia Picard Connect in order to contact the contributor
Submitted on : Monday, September 16, 2013 - 8:57:52 PM
Last modification on : Monday, July 4, 2022 - 9:02:30 AM
Long-term archiving on: : Friday, December 20, 2013 - 2:00:38 PM


  • HAL Id : tel-00862507, version 1


Célia Picard. Représentation coinductive des graphes. Théorie et langage formel [cs.FL]. Université Paul Sabatier - Toulouse III, 2012. Français. ⟨tel-00862507⟩



Record views


Files downloads