Rewriting Calculus with(out) Types - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Rewriting Calculus with(out) Types


The last few years have seen the development of a new calculus which can be considered as the outcome of the last decade of various researches on (higher order) term rewriting systems, and lambda calculi. In the Rewriting Calculus (or Rho Calculus), algebraic rules are considered as sophisticated forms of "lambda terms with patterns'', and rule applications as lambda applications with pattern matching facilities. The calculus can be "customized'' to work modulo sophisticated algebraic theories, like commutativity, associativity, associativity-commutativity, etc. This allows us to encode complex structures such as list, sets, and more generally objects. The calculus can be either be presented "a la Curry'' or "a la Church'' without sacrificing readability and without complicating too much the metatheory. Many static type systems can be easily plugged-in on the top of the calculus in the spirit of the rich "type-oriented'' literature. The Rewriting Calculus could represent a lingua franca to encode many paradigms of computations together with a formal basis used to build powerful theorem provers based on lambda calculus and efficient rewriting, and a step towards new proof engines based on the Curry-Howard isomorphism.
Fichier principal
Vignette du fichier
2002-wrla-02.pdf (340.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00100858 , version 1 (12-05-2015)



Horatiu Cirstea, Claude Kirchner, Luigi Liquori. Rewriting Calculus with(out) Types. WRLA 2002, 4th International Workshop on Rewriting Logic and Its Applications, Pisa, Italy 19–21 September 2002, Sep 2002, Pisa, Italy. pp.3-19, ⟨10.1016/S1571-0661(05)82526-5⟩. ⟨inria-00100858⟩
198 View
81 Download



Gmail Facebook X LinkedIn More