Skip to main content
SpringerLink
Log in

Composing Partially Ordered Monads

  • Conference paper
Book cover Relations and Kleene Algebra in Computer Science (RelMiCS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5827))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1975)

    Google Scholar 

  2. Adámek, J., Herrlich, H., Strecker, G.: Abstract and concrete categories. Wiley-Interscience, New York (1990)

    MATH  Google Scholar 

  3. Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  4. Beck, J.: Distributive laws, Seminars on Triples and Categorical Homology Theory, 1966/1967. Lecture Notes in Mathematics, vol. 80, pp. 119–140. Springer, Heidelberg (1969)

    Book  Google Scholar 

  5. Eklund, P., Galán, M.A., Gähler, W.: Partially ordered monads for monadic topologies, Kleene algebras and rough sets. Electronic Notes in Theoretical Computer Science 225(5), 67–81 (2009)

    Article  Google Scholar 

  6. Eklund, P., Gähler, W.: Generalized Cauchy spaces. Math. Nachr. 147, 219–233 (1990)

    MATH  MathSciNet  Google Scholar 

  7. Eklund, P., Gähler, W.: Fuzzy Filter Functors and Convergence. In: Rodabaugh, S.E., Klement, E.P., Höhle, U. (eds.) Applications of category theory to fuzzy subsets. Theory and Decision Library B, pp. 109–136. Kluwer, Dordrecht (1992)

    Google Scholar 

  8. Eklund, P., Gähler, W.: Completions and Compactifications by Means of Monads. In: Lowen, R., Roubens, M. (eds.) Fuzzy Logic, State of the Art, pp. 39–56. Kluwer, Dordrecht (1993)

    Google Scholar 

  9. Eklund, P., Gähler, W.: Partially ordered monads and powerset Kleene algebras. In: Proc. 10th Information Processing and Management of Uncertainty in Knowledge Based Systems Conference, IPMU 2004 (2004)

    Google Scholar 

  10. Eklund, P., Galán, M.A., Ojeda-Aciego, M., Valverde, A.: Set functors and generalised terms. In: Proc. 8th Information Processing and Management of Uncertainty in Knowledge-Based Systems Conference (IPMU 2000), pp. 1595–1599 (2000)

    Google Scholar 

  11. Eklund, P., Galán, M.A., Medina, J., Ojeda Aciego, M., Valverde, A.: A categorical approach to unification of generalised terms. Electronic Notes in Theoretical Computer Science 66(5) (2002), http://www.elsevier.nl/locate/entcs/volume66.html

  12. Gähler, W.: A topological approach to structure theory. Math. Nachr. 100, 93–144 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gähler, W.: Monads and convergence. In: Proc. Conference Generalized Functions, Convergences Structures, and Their Applications, Dubrovnik (Yugoslavia) 1987, pp. 29–46. Plenum Press, New York (1988)

    Google Scholar 

  14. Gähler, W.: General Topology – The monadic case, examples, applications. Acta Math. Hungar. 88, 279–290 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Gähler, W.: Extension structures and completions in topology and algebra. In: Seminarberichte aus dem Fachbereich Mathematik, Band 70, FernUniversität in Hagen (2001)

    Google Scholar 

  16. Gähler, W., Eklund, P.: Extension structures and compactifications. In: Categorical Methods in Algebra and Topology (CatMAT 2000), pp. 181–205 (2000)

    Google Scholar 

  17. Godement, R.: Topologie algébrique et théorie des faisceaux, appendix. Hermann, Paris (1958)

    Google Scholar 

  18. Goguen, J.A.: L-fuzzy sets. J. Math. Anal. Appl. 18, 145–174 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  19. Helgesson, R.: A categorical approach to logics and logic homomorphisms, UMNAD 676/07, Umeå University, Department of Computing Science (2007)

    Google Scholar 

  20. Huber, P.J.: Homotopy theory in general categories. Math. Ann. 144, 361–385 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  21. Keller, H.H.: Die Limesuniformisierbarkeit der Limesräume. Math. Ann. 176, 334–341 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  22. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–41. Princeton University Press, Princeton (1956)

    Google Scholar 

  23. Kowalsky, H.-J.: Limesräume und Komplettierung. Math. Nachr. 12, 301–340 (1954)

    Article  MATH  MathSciNet  Google Scholar 

  24. Kozen, D.: On induction vs.  ∗ -continuity. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 167–176. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  25. Kozen, D.: Kleene algebra with tests. ACM Transactions on Programming Languages and Systems 19, 427–443 (1999)

    Article  Google Scholar 

  26. Kuich, W., Salomaa, A.: Semirings, Automata, and Languages. Springer, Berlin (1986)

    Google Scholar 

  27. Lawvere, F.W.: Functorial Semantics of Algebraic Theories, Dissertation. Columbia University (1963)

    Google Scholar 

  28. Loeckx, J., Ehrich, H.-D., Wolf, M.: Specification of Abstract Data Types. Wiley-Teubner, Chichester (1996)

    MATH  Google Scholar 

  29. Manes, E.G.: Algebraic Theories. Springer, Heidelberg (1976)

    MATH  Google Scholar 

  30. Meseguer, J.: General logics. In: Ebbinghaus, H.-D., et al. (eds.) Logic Colloquium 1987, pp. 275–329. Elsevier, North-Holland, Amsterdam (1989)

    Google Scholar 

  31. Moggi, E.: An Abstract View of Programming Languages, Edinburgh Univ., Dept. of Comp. Sci. (1989)

    Google Scholar 

  32. Moggi, E.: Notions of computation and monads. Information and Computation 93, 55–92 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  33. Pratt, V.: Action Logic and Pure Induction. In: van Eijck, J. (ed.) JELIA 1990. LNCS, vol. 478, pp. 97–120. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  34. Richardson, G.D.: A Stone-Čech compactification for limit spaces. Proc. Amer. Math. Soc. 25, 403–404 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  35. Rydeheard, D.E., Burstall, R.M.: A categorical unification algorithm. In: Poigné, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol. 240, pp. 493–505. Springer, Heidelberg (1986)

    Google Scholar 

  36. Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. ACM 13, 158–169 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  37. Tarski, A.: On the calculus of relations. J. Symbolic Logic 6, 65–106 (1941)

    MathSciNet  Google Scholar 

  38. Wadler, P.: Comprehending monads. Mathematical Structures in Computer Science 2, 461–493 (1992)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, Umeå University, SE-90187, Umeå, Sweden

    Patrik Eklund & Robert Helgesson

Authors
  1. Patrik Eklund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Helgesson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Olshausenstraße 40, 24098, Kiel, Germany

    Rudolf Berghammer

  2. College of Engineering, Qatar University, P.O. Box 2713, CSE 209, Doha, Qatar,  

    Ali Mohamed Jaoua

  3. Institut für Informatik, Universität Augsburg, Universitätsstr. 6a, 86135, Augsburg, Germany

    Bernhard Möller

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eklund, P., Helgesson, R. (2009). Composing Partially Ordered Monads. In: Berghammer, R., Jaoua, A.M., Möller, B. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2009. Lecture Notes in Computer Science, vol 5827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04639-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04639-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04638-4

  • Online ISBN: 978-3-642-04639-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation