A rewriting calculus for cyclic higher-order term graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Mathematical Structures in Computer Science Année : 2007

A rewriting calculus for cyclic higher-order term graphs

Résumé

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.

Dates et versions

inria-00110872 , version 1 (02-11-2006)

Identifiants

Citer

Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, Claude Kirchner. A rewriting calculus for cyclic higher-order term graphs. Mathematical Structures in Computer Science, 2007, 17 (3), pp.363-406. ⟨10.1017/S0960129507006093⟩. ⟨inria-00110872⟩
81 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More