A Rho-Calculus of explicit constraint application - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Higher-Order and Symbolic Computation Year : 2007

A Rho-Calculus of explicit constraint application


Theoretical presentations of the rho-calculus often treat the matching constraint computations as an atomic operation although matching constraints are explicitly expressed. Actual implementations have to take a much more realistic view: computations needed in order to find the solutions of a matching equation can have an important impact on the (efficiency of the) calculus for some matching theories and the substitution application usually involves a term traversal. Following the works on explicit substitutions in the -calculus, we present two versions of the rho-calculus, one with explicit matching and one with explicit substitutions, together with a version that combines the two and considers efficiency issues and more precisely the composition of substitutions. The approach is general, allowing the extension to various matching theories. We establish the confluence of the calculus and the termination of the explicit constraint handling and application sub-calculus.
Fichier principal
Vignette du fichier
paper.pdf (215.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00000628 , version 1 (18-09-2006)
inria-00000628 , version 2 (07-11-2007)
inria-00000628 , version 3 (08-11-2007)



Horatiu Cirstea, Germain Faure, Claude Kirchner. A Rho-Calculus of explicit constraint application. Higher-Order and Symbolic Computation, 2007, Special Issue on Rewriting Logic and its Applications, 20, pp.37-72. ⟨10.1007/s10990-007-9004-2⟩. ⟨inria-00000628v3⟩
122 View
183 Download



Gmail Facebook X LinkedIn More