A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs

C.A. Grabmayer

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are complete with respect to the notion of "recursive type equality" on a restricted class of recursive types in μ-term notation. Here we show the existence of an immediate duality with a geometrical visualization between proofs in a variant of the coinductive axiom system due to Brandt and Henglein and "consistency-unfoldings" in a variant of a 'syntactic-matching' proof system for testing equations between recursive types due to Ariola and Klop. Finally we sketch an analogous result of a duality between a similar pair of proof systems for bisimulation equivalence on equational specifications of cyclic term graphs. © 2007 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)59-74
JournalElectronic Notes in Theoretical Computer Science
Volume72
DOIs
Publication statusPublished - 2002

Bibliographical note

DBLP:journals/entcs/Grabmayer07
Proceedings title: Proceedings of the First International Workshop on Term Graph Rewriting (TERMGRAPH 2002)
Publisher: Elsevier

Fingerprint Dive into the research topics of 'A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs'. Together they form a unique fingerprint.

Cite this