Completeness results for the equivalence of recursive schemas

Authors:
Bruno Courcelle;Jean Vuillemin
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1976

Citing 4
Cited 1

Inductive methods for proving properties of programs

Communications of the ACM
Comparative schematology

Record of the Project MAC conference on concurrent systems and parallel computation
Simple deterministic languages

SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
On formalised computer programs

Journal of Computer and System Sciences

EQUATIONAL TERM GRAPH REWRITING

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the possibilities of automating equivalence proofs for recursiveschemas. A formal proof system, adapted from work of J. W. deBakker and D. Scott, is shown to be complete with respect to provability of equivalence of pure recursive schemes. The result is obtained by showing the correspondence between operational and denotational semantics of a simple recursive language.