Coinductive graph representation
type: Dataset
description: 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.
landing page: https://theses.hal.science/tel-00862507
keyword: coinduction
keyword: graphes
keyword: infoeu-reposemanticsdoctoralthesis
keyword: infoinfo-flcomputer-science-csformal-languages-and-automata-theory-csfl
keyword: listes
keyword: melange-entre-induction-et-coinduction
keyword: prouveur-de-theoremes
keyword: theses
issued: 2026-05-09T17:37:11.337624
modified: 2026-05-09T17:37:11.337628
language: fr
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

Coinductive graph representation
type: Distribution
format: HTML
access URL: https://theses.hal.science/tel-00862507
issued: 2026-05-09T17:37:11.342033
modified: 2026-05-09T17:37:11.327737