Skip to main content
×
×
Home

A duality between proof systems for cyclic term graphs

  • CLEMENS GRABMAYER (a1)
Abstract

This paper presents a proof-theoretic observation about two kinds of proof systems for bisimilarity between cyclic term graphs.

First we consider proof systems for demonstrating that μ term specifications of cyclic term graphs have the same tree unwinding. We establish a close connection between adaptations for μ terms over a general first-order signature of the coinductive axiomatisation of recursive type equivalence by Brandt and Henglein (Brandt and Henglein 1998) and of a proof system by Ariola and Klop (Ariola and Klop 1995) for consistency checking. We show that there exists a simple duality by mirroring between derivations in the former system and formalised consistency checks, which are called ‘consistency unfoldings', in the latter. This result sheds additional light on the axiomatisation of Brandt and Henglein: it provides an alternative soundness proof for the adaptation considered here.

We then outline an analogous duality result that holds for a pair of similar proof systems for proving that equational specifications of cyclic term graphs are bisimilar.

Copyright
References
Hide All
Amadio, R. M. and Cardelli, L. (1993) Subtyping recursive types. ACM Transactions on Programming Languages and Systems 15 (4)575631.
Ariola, Z. M. and Klop, J. W. (1995) Equational term graph rewriting. Technical Report IR-391, Vrije Universiteit Amsterdam. (This is an extension of Ariola and Klop (1996).)
Ariola, Z. M. and Klop, J. W. (1996) Equational term graph rewriting. Fundamenta Informaticae 26 (3-4)207240.
Blom, S. (2001) Term Graph Rewriting, Syntax and Sematics, Ph.D. thesis, Vrije Universiteit Amsterdam.
Brandt, M. and Henglein, F. (1998) Coinductive axiomatization of recursive type equality and subtyping. Fundamenta Informaticae 33 130.
Grabmayer, C. (2002a) A duality in proof systems for recursive type equality and bisimulation equivalence on cyclic term graphs. In: Plump, D. (ed.) Proceedings of TERMGRAPH 2002. Electronic Notes in Computer Science 72 (1).
Grabmayer, C. (2002b) A duality in proof systems for recursive type equality and bisimulation equivalence on cyclic term graphs. Technical Report IR-499, Dept. of Math. and Comp. Sci., Vrije Universiteit Amsterdam. (Available from the authors's home page.)
Grabmayer, C. (2005) Relating Proof Systems for Recursive Types, Ph.D. thesis, Vrije Universiteit Amsterdam.
Hurkens, A. J. C., McArthur, M., Moschovakis, Y., Moss, L. S. and Whitney, G. (1998) The logic of recursive equations. Journal of Symbolic Logic 63 (2)451478.
Hüttel, H. and Stirling, C. (1991) Actions speak louder than words: Proving bisimilarity for context-free processes. In: Proceedings of LICS'91, IEEE Computer Society Press 376386.
Klop, J. W. (2000) Proof systems for cyclic term graphs. Lecture at the Winter Workshop on Logics, Types and Rewriting, February 1-3 2000, Heriot-Watt University, Edinburgh. (Available at: http://www.cs.vu.nl/jwk/ctg1-41.pdf.)
Milner, R. (1984) A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences 28 439466.
Moss, L. S. (2003) Recursion and corecursion have the same equational logic. Theoretical Computer Science 294 (1-2)233267.
Rosu, G. and Goguen, J. (2001) Circular coinduction. In: Proceedings of IJCAR'01, Siena, Italy.
Salomaa, A. (1966) Two complete axiom systems for the algebra of regular events. Journal of the ACM 13 (13)158169.
Sangiorgi, D. (1998) On the bisimulation proof method. Mathematical Structures in Computer Science 8 (5)447479.
Troelstra, A. and Schwichtenberg, H. (2000) Basic Proof Theory, Cambridge University Press.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed