Higher-Order and Symbolic Computation

, Volume 20, Issue 1, pp 37–72

A ρ-calculus of explicit constraint application

Article

DOI: 10.1007/s10990-007-9004-2

Cite this article as:
Cirstea, H., Faure, G. & Kirchner, C. Higher-Order Symb Comput (2007) 20: 37. doi:10.1007/s10990-007-9004-2

Abstract

Theoretical presentations of the rewriting or ρ-calculus often treat the matching constraint computations as an atomic operation although matching constraints are explicitly expressed. Actual implementations have to take a 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 ρ-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 for potential extensions to various matching theories. We establish the confluence of the calculus and the termination of the explicit constraint handling and application sub-calculus.

Keywords

Rewriting calculusExplicit substitutionExplicit matchingPattern matching

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Horatiu Cirstea
    • 1
  • Germain Faure
    • 2
  • Claude Kirchner
    • 3
  1. 1.Université Nancy 2 & LORIAVandoeuvre-lès-Nancy CedexFrance
  2. 2.Université Henri Poincaré & LORIAVandoeuvre-lès-Nancy CedexFrance
  3. 3.INRIA & LORIAVandoeuvre-lès-Nancy CedexFrance