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