Science of Computer Programming - Special issue on mathematics of program construction
Semantic analysis of normalisation by evaluation for typed lambda calculus
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
A Categorical Semantics of Quantum Protocols
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Structuring quantum effects: superoperators as arrows
Mathematical Structures in Computer Science
Containers: constructing strictly positive types
Theoretical Computer Science - Applied semantics: Selected topics
Applicative programming with effects
Journal of Functional Programming
Comonadic Notions of Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Categorical semantics for arrows
Journal of Functional Programming
Algebras for combinatorial search
Journal of Functional Programming
Commutative monads, diagrams and knots
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Arrows, like Monads, are Monoids
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
Matrices as arrows!: a biproduct approach to typed linear algebra
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Universal properties of impure programming languages
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-Order processes, functions, and sessions: a monadic integration
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
An algebraic presentation of predicate logic
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Relational algebraic ornaments
Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming
Typing linear algebra: A biproduct-oriented approach
Science of Computer Programming
Instances of Computational Effects: An Algebraic Perspective
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Freyd categories are Enriched Lawvere Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vector spaces, untyped and typed λ-calculus syntax and indexed containers. We show that the Kleisli and Eilenberg-Moore constructions carry over to relative monads and are related to relative adjunctions. Under reasonable assumptions, relative monads are monoids in the functor category concerned and extend to monads, giving rise to a coreflection between monads and relative monads. Arrows are also an instance of relative monads.