Formal Methods in Software Engineering

Axiomatization of the Coherence Property for Categories of Symmetries

Year1999
TypeConference
StatusProceedings
AuthorsDorel Lucanu

Links

Abstract

Given an equational theory (Σ, E), a relaxed (Σ, E)-system is a category S enriched with a Σ-algebra structure on both objects and arrows such that a natural isomorphism σ S ⇒ t′S), called natural symmetry, exists for each t = E t′. A symmetry is an instance of a natural symmetry. A category of symmetries, which includes only symmetries, is a free object in the category of relaxed (Σ, E)-systems. The coherence property states that the diagrams in a category of symmetries are commutative. In this paper we present a method for expressing the coherence property in an axiomatic way.

BibTeX

@INPROCEEDINGS{dl:fct99, author = {Lucanu, D.}, title = {Axiomatization of the Coherence Property for Categories of Symmetries}, booktitle = {Fundamentals of Computation Theory, 12th International Symposium FCT'99}, year = {1999}, series = {LNCS}, editor = {G. Ciobanu and Gh. P{u{a}}un}, volume = {1684}, pages = {386-405}, address = {Iac{s}i, Romania}, publisher = {Springer Verlag}, url = {http://thor.info.uaic.ro/~gabriel/fct99/ [FCT]}, url_publisher ={http://www.springerlink.com/content/ljw7upvknhen4phk/} }