Modular Monad Transformers
From MaRDI portal
Recommendations
Cited in
(30)- Monadification of functional programs
- Algebraic presentation of semifree monads
- Combining effects: sum and tensor
- Monads for behaviour
- Adaptable software: how to build a modular monadic extensible compiler using the state monad and pseudoconstructors over monadic values
- Backtracking, interleaving, and terminating monad transformers (functional pearl)
- Recursive monadic bindings
- Monads for incremental computing
- A coinductive calculus for asynchronous side-effecting processes
- Notions of computation as monoids
- scientific article; zbMATH DE number 2086588 (Why is no real title available?)
- scientific article; zbMATH DE number 2090722 (Why is no real title available?)
- scientific article; zbMATH DE number 2112364 (Why is no real title available?)
- A poor man's concurrency monad
- Monad transformers for backtracking search
- Eilenberg-Moore monoids and backtracking monad transformers
- Monads, indexes and transformations
- List Objects with Algebraic Structure
- Formal verification of monad transformers
- Lightweight monadic programming in ML
- Monads, zippers and views: virtualizing the monad stack
- Monads in action
- Modules over monads and their algebras
- Programming monads operationally with Unimo
- Evaluation strategies for monadic computations
- Tracing monadic computations and representing effects
- Towards a practical library for monadic equational reasoning in Coq
- Monad transformers as monoid transformers
- A practical formalization of monadic equational reasoning in dependent-type theory
- Extending equational monadic reasoning with monad transformers
This page was built for publication: Modular Monad Transformers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617691)