A rewriting calculus for cyclic higher-order term graphs

Paolo Baldan 1 Clara Bertolissi 2 Horatiu Cirstea 2 Claude Kirchner 2
1 DIPARTIMENTO DI INFORMATICA - Dipartimento di Informatica
2 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we propose an extension of the rho-calculus, called rhoG-calculus, handling structures with cycles and sharing rather than simple terms. This is obtained by using recursion constraints in addition to the standard rho-calculus matching constraints, which leads to a term-graph representation in an equational style. As for the rho-calculus, the transformations are performed by explicit application of rewrite rules as first class entities. The possibility of expressing sharing and cycles allows one to represent and compute over regular infinite entities.
Document type :
Journal articles
Liste complète des métadonnées
https://hal.inria.fr/inria-00110872
Contributor : Horatiu Cirstea <>
Submitted on : Thursday, November 2, 2006 - 11:23:00 AM
Last modification on : Thursday, January 11, 2018 - 6:19:57 AM

Links full text

openaccess

Identifiers

Collections

INRIA | LORIA | UNIV-LORRAINE

Citation

Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, Claude Kirchner. A rewriting calculus for cyclic higher-order term graphs. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2007, 17 (3), pp.363-406. 〈10.1017/S0960129507006093〉. 〈inria-00110872〉

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

168

Contact


archive-ouverte@inria.fr