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

Conditional rewrite rules as an algebraic semantics of processes

Eric Badouel 1
1 MICAS - Modèles et implémentation des calculs syntaxiques
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 5:59:30 PM
Last modification on : Friday, February 4, 2022 - 3:25:33 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 10:36:18 PM


  • HAL Id : inria-00075332, version 1


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



Record views


Files downloads