Conditional rewrite rules as an algebraic semantics of processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

Conditional rewrite rules as an algebraic semantics of processes

Abstract

We show that processes defined by equational identities together with conditional rewrite rules in Plotkin style can be given a purely algebraic description. A category of algebraic structures allowing for the specific nature of those languages is defined and its categorical properties are investigated. In particular it is shown how to derive new models from old by adding constraints either on the algebraic structures or on the categories in which their algebras lives.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1226.pdf (1.79 Mo) Télécharger le fichier

Dates and versions

inria-00075332 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00075332 , version 1

Cite

Eric Badouel. Conditional rewrite rules as an algebraic semantics of processes. [Research Report] RR-1226, INRIA. 1990. ⟨inria-00075332⟩
119 View
34 Download

Share

Gmail Facebook Twitter LinkedIn More