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.
Type de document :
Communication dans un congrès
Workshop on Multiset Processing, Aug 2000, Curtea de Arges, Romania, 17 p, 2000
Liste complète des métadonnées

https://hal.inria.fr/inria-00099053
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:48:42
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58
Document(s) archivé(s) le : mercredi 29 mars 2017 - 12:45:11

Fichiers

Identifiants

  • HAL Id : inria-00099053, version 1

Collections

Citation

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, 2000. 〈inria-00099053〉

Partager

Métriques

Consultations de la notice

67

Téléchargements de fichiers

30