On termination of the direct sum of term-rewriting systems
Information Processing Letters
Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Monad transformers and modular interpreters
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 1992 Glasgow Workshop on Functional Programming
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Monads and Modular Term Rewriting
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Composing monads using coproducts
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Explicit substitutions and higher-order syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Explicit substitutions and higher-order syntax
Higher-Order and Symbolic Computation
Gabriel–ulmer duality and lawvere theories enriched over a general base
Journal of Functional Programming
Monad-independent Hoare logic in HasCasl
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Hi-index | 0.00 |
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.