2001, `The rewriting calculus | Part I and II (2003) [3 citations — 1 self]
|
Abstract:
The -calculus integrates in a uniform and simple setting rst-order rewriting, -calculus and nondeterministic computations. Its abstraction mechanism is based on the rewrite rule formation and its main evaluation rule is based on matching modulo a theory T. We have seen in the rst part of this work the motivations, denitions and basic properties of the -calculus. This second part is rst devoted to the use of the -calculus for encoding a (conditional) rewrite relation. To this end we extend the calculus with a rst operator whose purpose is to detect rule application failure. This extension allows us to express recursively rule application and therefore to encode strategy based rewriting processes. We then use this extended calculus to give an operational semantics to ELAN programs. We conclude with an overview of ongoing and future works on -calculus.
Citations
| 795 | A Theory of Objects – Abadi, Cardelli - 1996 |
| 124 | Principles of Maude – Clavel, Eker, et al. - 1996 |
| 56 | Implicit induction in conditional theories – Bouhoula, Rusinowitch - 1995 |
| 16 | Calcul de réécriture: fondements et applications – Cirstea - 2000 |
| 5 | Specifying authentication protocols using elan – Cirstea - 1999 |
| 5 | Theorem proving using computational systems: The case of the B predicate prover – Cirstea, Kirchner - 1997 |
| 5 | The Simply Typed Rewriting Calculus – Cirstea, Kirchner - 2000 |
| 4 | Une approche deductive de la resolution de problemes de satisfaction de contraintes. These de Doctorat d'Universite, Universite Henri Poincare { Nancy 1 – Castro - 1998 |
| 2 | ELAN from the rewriting logic point of view. Research report – Borovansky, Kirchner, et al. - 1999 |
| 1 | The Lambda-Calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics – Barendregt - 1984 |
