Rewriting and Multisets in Rho-calculus and ELAN - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Romanian Journal of Information Science and Technology Year : 2001

Rewriting and Multisets in Rho-calculus and ELAN

Abstract

The 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 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 . We show how the set-like data structures are easily represented in ELAN and how this can be used in order to specify the Needham-Schroeder public-key protocol.
Not file

Dates and versions

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

Identifiers

  • HAL Id : inria-00100656 , version 1

Cite

Horatiu Cirstea, Claude Kirchner. Rewriting and Multisets in Rho-calculus and ELAN. Romanian Journal of Information Science and Technology, 2001, 4 (1-2), pp.33--48. ⟨inria-00100656⟩
60 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More