Skip to main content
SpringerLink
Log in

Combining Monads

  • Conference paper
Functional Programming, Glasgow 1992

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

Monads provide a way of structuring functional programs. Most real applications require a combination of primitive monads. Here we describe how some monads may be combined with others to yield a combined monad.

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. M. Barr and C. Wells, Toposes, Triples, and Theories. Springer Verlag, 1985.

    Google Scholar 

  2. M. Barr and C. Wells, Category Theory for Computing Science. Prentice Hall, 1990.

    Google Scholar 

  3. R. Bird, An Introduction to the Theory of Lists. In Logic of Programming and Calculi of Discrete Design, Springer Verlag, 1987.

    Google Scholar 

  4. P. Hudak, S. Peyton Jones and P. Wadler, editors, Report on the functional programming language Haskell, Version 1.2, SIGPLAN Notices, Vol. 27, No. 5, May 1992.

    Google Scholar 

  5. L. Meertens, Algorithmics - towards programming as a mathematical activity. In J. deBakker, M. Hazewinkel and L. Lenstra, editors, CWI Symposium on Mathematics and Computer Science, Vol. 1, CWI monographs, North Holland, 1986.

    Google Scholar 

  6. E. Moggi, Computational lambda-calculus and monads. In IEEE Symposium on Logic in Computer Science, June 1989.

    Google Scholar 

  7. M. Spivey, A Categorical Approach to the Theory of Lists. In Mathematics of Program Construction, LNCS 375, Springer Verlag, 1989.

    Google Scholar 

  8. P. Wadler, How to Replace Failure by a List of Successes. In Proceedings of Functional Programming and Computer Architecture, Springer-Verlag, LNCS 201, September 1985.

    Google Scholar 

  9. P. Wadler, Comprehending Monads. In ACM Conference of Lisp and Functional Programming, June 1990.

    Google Scholar 

  10. P. Wadler, The essence of functional programming. In 19’th ACM Symposium on Principles of Programming Languages, January 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ, Scotland, UK

    David J. King & Philip Wadler

Authors
  1. David J. King
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philip Wadler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, The University, G12 8QQ, Glasgow, Scotland

    John Launchbury MA (Oxon), MSc, PhD  & Patrick Sansom BSc (Hons)  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

King, D.J., Wadler, P. (1993). Combining Monads. In: Launchbury, J., Sansom, P. (eds) Functional Programming, Glasgow 1992. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3215-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3215-8_12

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19820-8

  • Online ISBN: 978-1-4471-3215-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation