Comprehending monads
From MaRDI portal
Combinatory logic and lambda calculus (03B40) Applications of universal algebra in computer science (08A70) Theories (e.g., algebraic theories), structure, and semantics (18C10) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Theory of programming languages (68N15) Data structures (68P05) Abstract data types; algebraic specification (68Q65)
Recommendations
- scientific article; zbMATH DE number 2068087
- Monads in action
- scientific article; zbMATH DE number 2086588
- Monads and theories
- scientific article; zbMATH DE number 4189993
- Notions of computation and monads
- Monads, indexes and transformations
- scientific article; zbMATH DE number 1497780
- Monads, partial evaluations, and rewriting
Cites work
Cited in
(80)- Query languages for bags and aggregate functions
- Monad as modality
- A new framework for declarative programming
- Expressive power of SQL.
- Generalising monads to arrows
- Layer by layer -- combining monads
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- Coalgebras and monads in the semantics of Java
- Kinded type inference for parametric overloading
- Modular verification of programs with effects and effects handlers
- Monads for the formalization of a pattern matching procedure
- Declarative pearl: deriving monadic quicksort
- Iterated covariant powerset is not a monad
- Generalized arrays for Stainless frames
- For a few dollars more. Verified fine-grained algorithm analysis down to LLVM
- Connected monads weakly preserve products
- A divertimento on MonadPlus and nondeterminism
- Powersets of terms and composite monads
- A novel formal approach to program slicing
- Boolean restriction categories and taut monads
- On a monadic semantics for freshness
- Monadic Sequence Testing and Explicit Test-Refinements
- Specification of logic programming languages from reusable semantic building blocks
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Shifting the stage. Staging with delimited control
- Algebraic dynamic programming for multiple context-free grammars
- Roles, stacks, histories: a triple for Hoare
- Provenance as dependency analysis
- Reflections on monadic lenses
- Comprehending Ringads
- Dragging proofs out of pictures
- Pointlessness is better than listlessness
- A reflection on types
- Recursion equations as a programming language
- Unifying theories of programming with monads
- A System F with Call-by-Name Exceptions
- Monadic combination using co limits and folds
- Libraries for generic programming in Haskell
- Object-oriented programming: some history, and challenges for the next fifty years
- Worker/Wrapper Transformation
- Translating regular expression matching into transducers
- An algebra for distributed Big Data analytics
- Push versus pull-based loop fusion in query engines
- Natural transformations as rewrite rules and monad composition
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
- scientific article; zbMATH DE number 2156365 (Why is no real title available?)
- scientific article; zbMATH DE number 1862079 (Why is no real title available?)
- scientific article; zbMATH DE number 2090024 (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?)
- Invariants of monadic coalgebras
- A graphical approach to monad compositions
- Strongly-Normalizing Higher-Order Relational Queries
- Monads, indexes and transformations
- Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs
- Typed equivalence of effect handlers and delimited control
- Wrapper semantics of an object-oriented programming language with state
- How to prove decidability of equational theories with second-order computation analyser SOL
- Monads, zippers and views: virtualizing the monad stack
- Computer Certified Efficient Exact Reals in Coq
- Simple and compositional reification of monadic embedded languages
- Taut monads, dynamic logic and determinism
- Compositional references for stateful functional programming
- Declarative debugging meets the world
- Fusion of recursive programs with computational effects
- A unifying approach to goal-directed evaluation
- Reversible monadic computing
- Constructing language processors with algebra combinators
- Plethysms and operads
- Monad transformers as monoid transformers
- Structured handling of scoped effects
- Generic multiset programming with discrimination-based joins and symbolic Cartesian products
- Principles of programming with complex objects and collection types
- Formal verification of an executable LTL model checker with partial order reduction
- Strongly normalizing higher-order relational queries
- Efficient iterative programs with distributed data collections
- Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
- Things to know when implementing KBO
- Arrows for secure information flow
- A computer-verified monadic functional implementation of the integral
This page was built for publication: Comprehending monads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4279255)
