## Rewriting calculus with(out) types (2002)

### Cached

### Download Links

- [www.loria.fr]
- [www.loria.fr]
- [www.loria.fr]
- DBLP

### Other Repositories/Bibliography

Venue: | Proceedings of the fourth workshop on rewriting logic and applications |

Citations: | 22 - 13 self |

### BibTeX

@INPROCEEDINGS{Cirstea02rewritingcalculus,

author = {Horatiu Cirstea and Claude Kirchner and Luigi Liquori},

title = {Rewriting calculus with(out) types},

booktitle = {Proceedings of the fourth workshop on rewriting logic and applications},

year = {2002}

}

### Years of Citing Articles

### OpenURL

### Abstract

The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting systems, and lambda calculi. In the Rewriting Calculus (or Rho Calculus, ρCal), 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 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 either be presented “à la Curry ” or “à la Church ” without sacrificing readability and without complicating too much the metatheory. Many static type systems can be easily plugged-in on 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. 1