A generalization of many-sorted algebras, called category-sorted algebras, is defined and applied to the language-design problem of avoiding anomalies in the interaction of implicit conversions and generic operators. The definition of a simple imperative language (without any binding mechanisms) is used as an example
This paper concerns the algebraic specification of abstract data types. It introduces and motivates...
This paper studies several applications of the notion of a presentation of a functor by operations a...
Heterogeneous algebraic theories and algebras are treated in detail with examples showing how to mod...
AbstractStructured data are generally composed from constituent parts by constructors and decomposed...
AbstractUniversal algebra is often known within computer science in the guise of algebraic specifica...
This extended abstract first presents a new category theoretic approach to equationally axiomatizabl...
A novel framework for algebraic specification of abstract data types is introduced. It involves so-c...
Algebraic theories, introduced as a concept in the 1960s, have been a fundamental step towards a cat...
In this paper we outline a category-theoretic approach to the semantics of ALGOL-like languages in w...
AbstractIn a series of papers, Mosses and Watt define action semantics, a metalanguage for high leve...
Abstract. Algorithms in computer algebra lend themselves naturally to the software design method of ...
AbstractThis paper presents the prototype design of an algebraic computation system that manipulates...
AbstractThis paper studies several applications of the notion of a presentation of a functor by oper...
Category theory is proving a useful tool in programming and program specification - not only as a de...
Given a category C with finite products and a strong monad T on C, we investigate axioms under which...
This paper concerns the algebraic specification of abstract data types. It introduces and motivates...
This paper studies several applications of the notion of a presentation of a functor by operations a...
Heterogeneous algebraic theories and algebras are treated in detail with examples showing how to mod...
AbstractStructured data are generally composed from constituent parts by constructors and decomposed...
AbstractUniversal algebra is often known within computer science in the guise of algebraic specifica...
This extended abstract first presents a new category theoretic approach to equationally axiomatizabl...
A novel framework for algebraic specification of abstract data types is introduced. It involves so-c...
Algebraic theories, introduced as a concept in the 1960s, have been a fundamental step towards a cat...
In this paper we outline a category-theoretic approach to the semantics of ALGOL-like languages in w...
AbstractIn a series of papers, Mosses and Watt define action semantics, a metalanguage for high leve...
Abstract. Algorithms in computer algebra lend themselves naturally to the software design method of ...
AbstractThis paper presents the prototype design of an algebraic computation system that manipulates...
AbstractThis paper studies several applications of the notion of a presentation of a functor by oper...
Category theory is proving a useful tool in programming and program specification - not only as a de...
Given a category C with finite products and a strong monad T on C, we investigate axioms under which...
This paper concerns the algebraic specification of abstract data types. It introduces and motivates...
This paper studies several applications of the notion of a presentation of a functor by operations a...
Heterogeneous algebraic theories and algebras are treated in detail with examples showing how to mod...