Calcul de réécriture explicite - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2003

Calcul de réécriture explicite


The contributions of this report are twofold. First, we will give the intuition of how programs can be represented in the rewriting calculus. We will compare with the lambda-calculus and take many examples of OCaml programs. Secondly, we propose, study and exemplify a rewriting calculus with explicit constraint handling. In this calculus, matching and application of substitutions become explicit. The approach is really modular, allowing extension to arbitrary matching theories. We will also prove that the calculus is powerful enough to deal with errors. We will afterwards prove the confluence of the calculus and the termination of the ``explicit'' part of the calculus, some non trivial proofs. We conclude by an other extension of the calculus to handle composition of substitutions.
No file

Dates and versions

inria-00099645 , version 1 (26-09-2006)


  • HAL Id : inria-00099645 , version 1


Germain Faure. Calcul de réécriture explicite. [Internship report] A03-R-324 || faure03a, 2003, 40 p. ⟨inria-00099645⟩
66 View
0 Download


Gmail Facebook Twitter LinkedIn More