Composing Partially Ordered Monads

Authors:
Patrik Eklund;Robert Helgesson
Affiliations:
Department of Computing Science, Umeå University, Umeå, Sweden SE-90187;Department of Computing Science, Umeå University, Umeå, Sweden SE-90187
Venue:
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Year:
2009

Citing 11
Cited 0

Semirings, automata, languages

Semirings, automata, languages
A categorical unification algorithm

Proceedings of a tutorial and workshop on Category theory and computer programming
Abstract and concrete categories

Abstract and concrete categories
Notions of computation and monads

Information and Computation
Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
Specification of abstract data types

Specification of abstract data types
Two Complete Axiom Systems for the Algebra of Regular Events

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Action Logic and Pure Induction

JELIA '90 Proceedings of the European Workshop on Logics in AI
On Induction vs. *-Continuity

Logic of Programs, Workshop
Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Composition of the many-valued powerset partially ordered monad with the term monad provides extensions to non-classical relations and also new examples for Kleene algebras.