HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Rewriting and Multisets in the Rewriting Calculus and ELAN

Horatiu Cirstea 1 Claude Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The rewriting calculus is a new calculus that integrates in a uniform and simple setting first-order rewriting, lambda-calculus and non-deterministic computations. The main design concept of the rewriting calculus is to make all the basic ingredients of rewriting explicit objects, in particular the notions of rule application and multisets of results. This paper describes the calculus from its syntax to its basic properties in the untyped case. The rewriting calculus embeds first-order conditional rewriting and lambda-calculus and it can be used in order to give an operational semantics to the rewrite based language Elan. We show how the set-like data structures are easily represented in Elan and how this can be used in order to specify protocols.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:48:42 AM
Last modification on : Friday, February 4, 2022 - 3:22:16 AM
Long-term archiving on: : Wednesday, March 29, 2017 - 12:45:11 PM


  • HAL Id : inria-00099053, version 1



Horatiu Cirstea, Claude Kirchner. Rewriting and Multisets in the Rewriting Calculus and ELAN. Workshop on Multiset Processing, Aug 2000, Curtea de Arges, Romania, 17 p. ⟨inria-00099053⟩



Record views


Files downloads