Rewriting and Multisets in the Rewriting Calculus and ELAN - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

Rewriting and Multisets in the Rewriting Calculus and ELAN

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
A00-R-238.pdf (247.09 Ko) Télécharger le fichier

Dates and versions

inria-00099053 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099053 , version 1

Cite

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⟩
49 View
61 Download

Share

Gmail Facebook X LinkedIn More