Skip to main content

Lifting theorems for Kleisli categories

  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Programming Semantics (MFPS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 802))

Abstract

Monads, comonads and categories of algebras have become increasingly important tools in formulating and interpreting concepts in programming language semantics. A natural question that arises is how various categories of algebras for different monads relate functorially. In this paper we investigate when functors between categories with monads or comonads can be lifted to their corresponding Kleisli categories. Determining when adjoint pairs of functors can be lifted or inherited is of particular interest. The results lead naturally to various applications in both extensional and intensional semantics, including work on partial maps and data types and the work of Brookes/Geva on computational comonads.

This research was partially supported by NSF Grants CCR-9002251, CCR-9203106, INT-9113406 and a Colgate University Picker Fellowship.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Applegate H., Acyclic models and resolvent functors, dissertation, Columbia University, 1965.

    Google Scholar 

  2. Brookes S., Geva S., Computational comonads and intensional semantics, Applications of Category Theory, LMSLNS 177, (1992) 1–44, Cambridge University Press.

    Google Scholar 

  3. Crole R. L., Pitts A. M., New Foundations for FixPoint Computations, Proceedings of LICS, University of Pennsylvania, 1990.

    Google Scholar 

  4. Freyd P., Algebraically Complete Categories, preprint, 1991.

    Google Scholar 

  5. Freyd P., Mulry P., Rosolini G., Scott D., Extensional PERs, Information and Computation, 98 (1992), 211–227.

    Google Scholar 

  6. Johnstone P. T., Adjoint Lifting Theorems for Categories of Algebras, Bull. London Math. Soc., 7 (1975), 294–297.

    Google Scholar 

  7. Kock A., Strong functors and monoidal monads, Arch. Math., 23 (1972), 113–120.

    Google Scholar 

  8. Manes E. G., A triple miscellany: some aspects of the theory of algebras over a triple, dissertation, Wesleyan University, 1967.

    Google Scholar 

  9. Moggi E., Notions of Computations and Monads, Information and Computation, 93 (1991), 55–92.

    Google Scholar 

  10. Mulry P. S., Monads and Algebras in the Semantics of Partial Data Types, Theoretical Computer Science, 99 (1992), 141–155.

    Google Scholar 

  11. Mulry P. S., Strong Monads, Algebras and Fixed Points, Applications of Category Theory, LMSLNS 177, (1992) 202–216, Cambridge University Press.

    Google Scholar 

  12. Mulry P. S., Partial Map Classifiers and Partial Cartesian Closed Categories, to appear.

    Google Scholar 

  13. Mulry P. S., Partial Sheaf Semantics, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Stephen Brookes Michael Main Austin Melton Michael Mislove David Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mulry, P.S. (1994). Lifting theorems for Kleisli categories. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1993. Lecture Notes in Computer Science, vol 802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58027-1_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-58027-1_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58027-0

  • Online ISBN: 978-3-540-48419-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics