Permutations in Coinductive Graph Representation
In the proof assistant Coq, one can model certain classes of graphs by coinductive types. The coinductive aspects account for infinite navigability already in finite but cyclic graphs, as in rational trees. Coq’s static checks exclude simple-minded definitions with lists of successors of a node. In previous work, we have shown how to mimic lists by a type of functions and built a Coq theory for such graphs. Naturally, these coinductive structures have to be compared by a bisimulation relation, and we defined it in a generic way.
However, there are many cases in which we would not like to distinguish between graphs that are constructed differently and that are thus not bisimilar, in particular if only the order of elements in the lists of successors is not the same. We offer a wider bisimulation relation that allows permutations. Technical problems arise with their specification since (1) elements have to be compared by a not necessarily decidable relation and (2) coinductive types are mixed with inductive ones. Still, a formal development has been carried out in Coq, by using its built-in language for proof automation.
Another extension of the original bisimulation relation based on cycle analysis provides indifference concerning the root node of the term graphs.
KeywordsBase Relation Inductive Tree Proof Assistant Pigeonhole Principle Bisimulation Relation
- 3.Berger, U.: From coinductive proofs to exact real arithmetic: theory and applications. Logical Methods in Computer Science 7(1) (2011)Google Scholar
- 4.Bertot, Y., Komendantskaya, E.: Using structural recursion for corecursion. In: Berardi et al. , pp. 220–236Google Scholar
- 5.Chlipala, A.: In Coq club thread “is Coq being too conservative?” (January 2010), https://sympa-roc.inria.fr/wws/arc/coq-club/2010-01/msg00089.html
- 8.Dams, C.: In Coq club thread “is Coq being too conservative?” (January 2010), https://sympa-roc.inria.fr/wws/arc/coq-club/2010-01/msg00085.html
- 9.Danielsson, N.A.: Beating the productivity checker using embedded languages. In: Bove, A., Komendantskaya, E., Niqui, M. (eds.) Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers. EPTCS, vol. 43, pp. 29–48 (2010)Google Scholar
- 11.Giménez, E., Castéran, P.: A tutorial on [co-]inductive types in Coq (2007), http://www.labri.fr/perso/casteran/RecTutorial.pdf
- 13.Nakata, K., Uustalu, T.: Resumptions, weak bisimilarity and big-step semantics for while with interactive I/O: An exercise in mixed induction-coinduction. In: Aceto, L., Sobocinski, P. (eds.) SOS. EPTCS, vol. 32, pp. 57–75 (2010)Google Scholar
- 15.Niqui, M.: Coalgebraic reasoning in Coq: Bisimulation and the lambda-coiteration scheme. In: Berardi et al. , pp. 272–288Google Scholar
- 16.Picard, C., Matthes, R.: Coinductive graph representation: the problem of embedded lists. Electronic Communications of the EASST 39, 24 pages (2011)Google Scholar
- 17.Picard, C., Matthes, R.: Formalization in Coq for this article (2012), http://www.irit.fr/~Celia.Picard/Coq/Permutations/
- 19.The Coq Development Team: The Coq Proof Assistant Reference Manual, http://coq.inria.fr
- 20.The Coq Development Team: The Coq Proof Assistant Standard Library, http://coq.inria.fr/stdlib/Coq.Sorting.Permutation.html
- 21.The Coq Development Team: The Coq Proof Assistant Standard Library, http://coq.inria.fr/stdlib/Coq.Sorting.PermutSetoid.html#permutation