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 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.
Complete list of metadatas

https://hal.inria.fr/inria-00000628
Contributor : Germain Faure <>
Submitted on : Monday, September 18, 2006 - 8:39:05 AM
Last modification on : Thursday, January 11, 2018 - 6:19:57 AM
Long-term archiving on : Friday, April 2, 2010 - 6:54:10 PM

Identifiers

  • HAL Id : inria-00000628, version 1

Citation

Horatiu Cirstea, Germain Faure, Claude Kirchner. A Rho-Calculus of explicit constraint application. Higher-Order and Symbolic Computation, Springer Verlag, 2006, 20. ⟨inria-00000628v1⟩

Share

Metrics

Record views

13

Files downloads

18