scientific article; zbMATH DE number 3924120
[For the entire collection see Zbl 0568.00021.] The article presents basic constructions and results about monads with indications of their use in the construction of programs and in proving properties about them. The first part of the article is a compendium of results about monads and their algebras. The second part looks at a construction of free monads in detail introducing signatures for monads and proof rules. The third contains examples of the construction which is of interest as a means of understanding and writing iterative programs. The paper hints at the fact that category theory can provide powerful programming constructs, like some advocated by Backus, together with proofs of correctness.
- Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
- Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories
- Monad as modality
- Laws of monadic error handling
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 4179373 (Why is no real title available?)
- Monadic maps and folds for multirelations in an allegory
- Implementing collection classes with monads
- scientific article; zbMATH DE number 2068087 (Why is no real title available?)
- scientific article; zbMATH DE number 1522507 (Why is no real title available?)
- scientific article; zbMATH DE number 2156365 (Why is no real title available?)
- Monads and modularity
- scientific article; zbMATH DE number 7324076 (Why is no real title available?)
- Unique-sort order-sorted theories : A description as monad morphisms
- Rod Burstall: in memoriam (1934--2025)
- Dijkstra and Hoare monads in monadic computation
- The proof monad
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698294)