Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

FCT
2001
Springer

favoriteEmaildiscussreport

125views Applied Computing» more FCT 2001»

Universal Algebra and Computer Science

13 years 10 months ago

Universal Algebra and Computer Science

Download www.math.uni-duesseldorf.de

Abstract. Generalising modules over associative rings, the notion of modules for an endofunctor of any category is well established and useful in large parts of mathematics including universal algebra. Similarly, comodules over coalgebras are the model for comodules for an endofunctor and they are of basic importance. Compatibility conditions between endofunctors can be described by distributive laws. We use these ingredients to deﬁne bimonads and Hopf monads on arbitrary categories thus making these notions accessible to universal algebra.

Boris I. Plotkin, Tanya Plotkin

Real-time Traffic

Applied Computing | Associative Rings | FCT 2001 | Hopf Monads | Universal Algebra |

claim paper

Related Content

» Universal Algebra for Termination of HigherOrder Rewriting

» The Category Theoretic Understanding of Universal Algebra Lawvere Theories and Monads

» Proof Theory for Kleene Algebra

» Vector Math for 3D Computer Graphics

» Universality and semicomputability for nondeterministic programming languages over abstrac...

» Notes on Coding Theory

» Universal Algebra and Hardness Results for Constraint Satisfaction Problems

» Algebra and Computation

» The New Computational and Data Sciences Undergraduate Program at George Mason University

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	FCT
Authors	Boris I. Plotkin, Tanya Plotkin

Comments (0)