Abstract
This paper argues that the core of modularity problems is an understanding of how individual components of a large system interact with each other, and that this interaction can be described by a layer structure. We propose a uniform treatment of layers based upon the concept of a monad. The combination of different systems can be described by the coproduct of monads.
Concretely, we give a construction of the coproduct of two monads and show how the layer structure in the coproduct monad can be used to analyse layer structures in three different application areas, namely term rewriting, denotational semantics and functional programming.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Haskell 98: A non-strict, purely functional language. Available at http://www.haskell.org, January 1999.
J. Adamek and J. Rosický. Locally Presentable and Accessible Categories. LMS Lecture Notes 189, Cambridge University Press, 1994.
E. J. Dubuc and G. M. Kelly. A presentation of topoi as algebraic relative to categories or graphs. Journal for Algebra, 81:420–433, 1983.
M. Fiore, G. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proc. LICS’99, pages 193–202. IEEE Computer Society Press, 1999.
N. Ghani, C. Lüth, F. de Marchi, and J. Power. Algebras, coalgebras, monads and comonads. Proc. CMCS’01, ENTCS 44:1, 2001.
M. Jones and L. Duponcheel. Composing monads. Technical Report YALEU/DCS/RR-1004, Yale University, Dept. Comp. Sci, Dec 1993.
G. M. Kelly. A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves and so on. Bulletins of the Australian Mathematical Society, 22:1–83, 1980.
D. King and P. Wadler. Combining monads. In J. Launchbury and P.M. Samson, eds., Functional Programming, Workshops in Computing, 1993.
S. Liang, P. Hudak, and M. Jones. Monad transformers and modular interpreters. In Proc. of the 22nd ACM Symposium on Principles of Programming Languages. ACM Press, Jan 1995.
C. Lüth. Categorical Term Rewriting: Monads and Modularity. PhD thesis, University of Edinburgh, 1998.
C. Lüth and N. Ghani. Monads and modular term rewriting. In CTCS’97, LNAI 1290, pages 69–86. Springer, Sep 1997.
S. Mac Lane. Categories for the Working Mathematician, Graduate Texts in Mathematics 5. Springer, 1971.
E. Moggi. Computational lambda-calculus and monads. In Proc. LICS’89. IEEE, Computer Society Press, June 1989.
E. Moggi. An abstract view of programming languages. Technical Report ECSLFCS-90-113, LFCS, 1990.
M. Rusinowitch. On the termination of the direct sum of term-rewriting systems. Information Processing Letters, 26(2):65–70, 1987.
D. T. Sannella and R. M. Burstall. Structured theories in LCF. In 8 th Colloquium on Trees in Algebra and Programming, LNAI 159, pages 377–391. Springer, 1983.
D. T. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Computation, 76(2/3):165–210, Feb/Mar 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lüth, C., Ghani, N. (2002). Monads and Modularity. In: Armando, A. (eds) Frontiers of Combining Systems. FroCoS 2002. Lecture Notes in Computer Science(), vol 2309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45988-X_3
Download citation
DOI: https://doi.org/10.1007/3-540-45988-X_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43381-1
Online ISBN: 978-3-540-45988-0
eBook Packages: Springer Book Archive