Monads for incremental computing

DOI10.1145/581478.581482MaRDI QIDQ2949188zbMATH OpenOpenAlexFDO

Authors Magnus Carlsson

Publication date 7 October 2015

Published in Proceedings of the seventh ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/581478.581482

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Functional programming and lambda calculus (68N18)

Recommendations

• Monad transformers as monoid transformers
• Modular Monad Transformers
• Efficiency by incrmentalization: An introduction
• Monadic augment and generalised short cut fusion
• Incremental computing with abstract data structures

Cited in

(16)

• Monad transformers as monoid transformers
• Monads, zippers and views: virtualizing the monad stack
• Dijkstra Monads in Monadic Computation
• MRI: modular reasoning about interference in incremental programming
• Minimal on-line labelling
• Incremental computing with abstract data structures
• Refinement types for incremental computational complexity
• Monads for the formalization of a pattern matching procedure
• scientific article; zbMATH DE number 2112364 (Why is no real title available?)
• On the parameterized complexity of dynamic problems
• Continuous monads
• Pruning with improving sequences in lazy functional programs
• Tracing monadic computations and representing effects
• Asymptotic Improvement of Computations over Free Monads
• Imperative streams—a monadic combinator library for synchronous programming
• Compositional references for stateful functional programming

This page was built for publication: Monads for incremental computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949188)