Monads and effects
From MaRDI portal
Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Categorical semantics of formal languages (18C50) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Recommendations
Cited in
(49)- A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- Laws of monadic error handling
- Trace semantics via determinization
- Combining effects: sum and tensor
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- Monadic encapsulation in ML
- Monads and adjunctions for global exceptions
- Comonadic notions of computation
- Relating Computational Effects by ⊤ ⊤-Lifting
- A counterexample to tensorability of effects
- Counting successes: effects and transformations for non-deterministic programs
- Unifying theories of programming with monads
- VDM Semantics of Programming Languages: Combinators and Monads
- Modular Monad Transformers
- The essence of expression refinement
- Abstract ordered compact convex sets and algebras of the (sub)probabilistic powerdomain monad over ordered compact spaces
- Programming with algebraic effects and handlers
- Semantics of value recursion for Monadic Input/Output
- Monad-independent Dynamic Logic in HasCasl
- A monad for full ground reference cells
- Lightweight monadic programming in ML
- Generic Hoare logic for order-enriched effects with exceptions
- Taming effects with monadic typing
- The marriage of effects and monads
- Programming and reasoning with algebraic effects and dependent types
- Simple and compositional reification of monadic embedded languages
- Monads in action
- The marriage of effects and monads
- Taming effects with monadic typing
- The marriage of effects and monads
- Interleaving data and effects
- Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language
- Reasoning about conditional probabilities in a higher-order-logic theorem prover
- Affine Monads and Side-Effect-Freeness
- Evaluation strategies for monadic computations
- Tracing monadic computations and representing effects
- On reduction and normalization in the computational core
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- Monad transformers as monoid transformers
- Partially ordered fuzzy power set monads on the category of L-sets and their associated categories of topological space objects
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- What monads can and cannot do with a few extra pages
- A practical formalization of monadic equational reasoning in dependent-type theory
- Intersection types for a computational lambda-calculus with global state
- The quantum monadology
- Combining algebraic effects with continuations
- Generic weakest precondition semantics from monads enriched with order
- Modules over monads and initial semantics
This page was built for publication: Monads and effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813222)