|
Courses and Workshops
|
| Title: | The rewriting calculus |
| Lecturer(s): | Claude Kirchner (LORIA and INRIA), Luigi Liquori (LORIA and INRIA) and Horatiu Cirstea (LORIA and University Nancy 2) |
| Type: | Advanced Course |
| Section: | Logic and Computation |
| Week: | Second | | Time: | 14.00-15.30 (Slot 3) |
| Webpage: | http://www.loria.fr/~ckirchne
|
| Reader: | Course will not have a reader | | Room: | C2 |
Description The rewriting calculus has been introduced as a general means to
uniformly integrate rewriting and lambda calculus. This calculus makes
explicit and first-class all of its components: matching (possibly
modulo given theories), abstraction, application and substitutions. This
advanced lecture will first introduce the calculus and its general
properties. Then we will present the typed version of the calculus, from
the simply typed version that allows in particular to type fixpoints and
consequently strategies, to the pure pattern type system that
generalizes standard PTS. One of the nice feature of the rewriting
calculus is to naturally express exceptions and imperative features.
This will be presented before showing the rewriting calculus at work
either for logical purposes, for expressing rewriting strategies, for
the semantics of rule based as well as object oriented paradigms.
Applications and examples based on implementations of the rewriting
calculus and on the ELAN system will be developped all along the lecture.
|
© 2003, 2004 LORIA, Carlos Areces. |
2003-11-20
| |
