A rho-calculus of explicit constraint application. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

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 be really important in some matching theories and the substitution application usually involves a term traversal. Following the works on explicit substitutions in the λ-calculus, we propose, study and exemplify a rho-calculus with explicit constraint handling, up to the level of substitution applications. The approach is general, allowing the extension to various matching theories. We show that the calculus is powerful enough to deal with errors. We establish the confluence of the calculus and the termination of the explicit constraint handling and application sub-calculus.
Fichier principal
Vignette du fichier
wrla2004-19.pdf (287.22 Ko) Télécharger le fichier

Dates and versions

inria-00095626 , version 1 (18-09-2006)


  • HAL Id : inria-00095626 , version 1


Horatiu Cirstea, Germain Faure, Claude Kirchner. A rho-calculus of explicit constraint application.. Workshop on Rewriting Logic and Applications, Mar 2004, Barcelona (Spain), Spain. ⟨inria-00095626⟩
66 View
101 Download


Gmail Facebook Twitter LinkedIn More