Comprehending monads
DOI10.1017/S0960129500001560zbMATH Open0798.68040OpenAlexW4214538532MaRDI QIDQ4279255FDOQ4279255
Publication date: 31 October 1994
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129500001560
Theory of programming languages (68N15) Data structures (68P05) Combinatory logic and lambda calculus (03B40) 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) Abstract data types; algebraic specification (68Q65) Applications of universal algebra in computer science (08A70)
Cites Work
Cited In (64)
- Object-oriented programming: some history, and challenges for the next fifty years
- Monad transformers as monoid transformers
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- Reversible monadic computing
- Formal verification of an executable LTL model checker with partial order reduction
- A new framework for declarative programming
- Arrows for secure information flow
- Invariants of monadic coalgebras
- Iterated covariant powerset is not a monad
- Expressive power of SQL.
- Dragging Proofs Out of Pictures
- Kinded type inference for parametric overloading
- Translating regular expression matching into transducers
- Layer by layer -- combining monads
- For a few dollars more. Verified fine-grained algorithm analysis down to LLVM
- Provenance as dependency analysis
- Query languages for bags and aggregate functions
- Monads for the formalization of a pattern matching procedure
- Things to know when implementing KBO
- Coalgebras and monads in the semantics of Java
- Algebraic dynamic programming for multiple context-free grammars
- Connected monads weakly preserve products
- Constructing language processors with algebra combinators
- Libraries for Generic Programming in Haskell
- Computer Certified Efficient Exact Reals in Coq
- A System F with Call-by-Name Exceptions
- Generalized arrays for Stainless frames
- On a monadic semantics for freshness
- How to prove decidability of equational theories with second-order computation analyser SOL
- Taut Monads, Dynamic Logic and Determinism
- Strongly-Normalizing Higher-Order Relational Queries
- Monadic Sequence Testing and Explicit Test-Refinements
- Title not available (Why is that?)
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- An algebra for distributed Big Data analytics
- Comprehending Ringads
- Unifying Theories of Programming with Monads
- Powersets of terms and composite monads
- Modular verification of programs with effects and effects handlers
- Specification of logic programming languages from reusable semantic building blocks
- Boolean restriction categories and taut monads
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Reflection on Types
- Pointlessness is Better than Listlessness
- Reflections on Monadic Lenses
- Shifting the stage. Staging with delimited control
- Generic multiset programming with discrimination-based joins and symbolic Cartesian products
- Monad as modality
- Principles of programming with complex objects and collection types
- A novel formal approach to program slicing
- A computer-verified monadic functional implementation of the integral
- Roles, stacks, histories: A triple for Hoare
- Declarative Debugging Meets the World
- A graphical approach to monad compositions
- A unifying approach to goal-directed evaluation
- Title not available (Why is that?)
- Wrapper semantics of an object-oriented programming language with state
- Plethysms and operads
- Structured handling of scoped effects
- Fusion of recursive programs with computational effects
- Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs
- Push versus pull-based loop fusion in query engines
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Monads in action 👍 👎
- Title not available (Why is that?) 👍 👎
- Monads and theories 👍 👎
- Title not available (Why is that?) 👍 👎
- Notions of computation and monads 👍 👎
- Monads, indexes and transformations 👍 👎
- Title not available (Why is that?) 👍 👎
- Monads, partial evaluations, and rewriting 👍 👎
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)
