Abstract

ing from syntax. Conventionally an equation for algebra ' is just a pair of terms built from variables, the constituent operations of ' , and some fixed standard operations. An equation is valid if the two terms are equal for all values of the variables. We are going to model a syntactic term as a morphism that has the values of the variables as source. For example, the two terms ` x ' and ` x join x ' (with variable x of type tree ) are modeled by morphisms id and id \Delta id ; join of type tree ! tree . So, an equation for ' is modeled by a pair of terms (T '; T 0 ') , T and T 0 being mappings of morphisms which we call `transformers'. This faces us with the following problem: what properties must we require of an arbitrary mapping T in order that it model a classical syntactic Datatype Laws without Signatures 7 term? Or, rather, what properties of classical syntactic terms are semantically essential, and how can we formalise these as properties of a transformer T ? Of course...

Citations

369	Category Theory for Computing Science - Barr, Wells - 1990
275	Functional Programming with Bananas, Lenses, Envelopes and Barbed - Meijer, Fokkinga, et al. - 1991
149	Basic Category Theory for Computer Scientists - Pierce - 1991
101	Data Structures and Program Transformation - Malcolm - 1990
92	Law and Order in Algorithmics - Fokkinga - 1992
78	Algebraic Data Types and Program Transformation - Malcolm - 1990
30	Category Theoretic Approach to Data Types - Hagino - 1987
11	Constructing a calculus of programs - Meertens - 1989
11	More advice on proving a compiler correct: Improve a correct compiler - Meijer - 1994
7	Algebraic Approaches to Program Semantics. Text and Monographs in Computer Science - Manes, Arbib - 1986
3	Calculate categorically! Formal - Fokkinga - 1992
1	Fundamentals of Equational Specification 1 — equations and initial semantics - Ehrig, Mahr - 1985
1	On the algebra of order — extended abstract - Lehmann - 1978
1	On the algebra of order - Lehmann - 1980