HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A rho-calculus of explicit constraint application.

Horatiu Cirstea 1 Germain Faure 1 Claude Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

Contributor : Germain Faure Connect in order to contact the contributor
Submitted on : Monday, September 18, 2006 - 9:39:47 AM
Last modification on : Friday, February 4, 2022 - 3:30:05 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 1:00:34 AM


  • 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⟩



Record views


Files downloads