A mathematical approach to nondeterminism in data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Nondeterminism in algebraic specifications and algebraic programs
Nondeterminism in algebraic specifications and algebraic programs
A complete calculus for the multialgebraic and functional semantics of nondeterminism
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Multialgebras, Power Algebras and Complete Calculi of Identities and Inclusions
Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting
Proceedings of the International Workshop on Algebraic and Logic Programming
Compositional Homomorphisms of Relational Structures
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Category Theory and Computer Science
A categorical programming language
A categorical programming language
Hi-index | 0.00 |
Multialgebras generalise algebraic semantics to handle nondeterminism. They model relational structures, representing relations as multivalued functions by selecting one argument as the “result”. This leads to strong algebraic properties missing in the case of relational structures. However, such strong properties can be obtained only by first choosing appropriate notion of homomorphism. We summarize earlier results on the possible notions of compositional homomorphisms of multialgebras and investigate in detail one of them, the outer-tight homomorphisms which yield rich structural properties not offered by other alternatives. The outer-tight homomorphisms are different from those obtained when relations are modeled as coalgebras and the associated congruence is the converse bisimulation equivalence. The category is cocomplete but initial objects are of little interest (essentially empty). On the other hand, the category does not, in general, possess final objects for the usual cardinality reasons. The main objective of the paper is to show that Aczel's construction of final coalgebras for set-based functors can be modified and applied to multialgebras. We therefore extend the category admitting also structures over proper classes and show the existence of final objects in this category.