Deriving backtracking monad transformers

DOI10.1145/351240.351258MaRDI QIDQ2943369zbMATH OpenOpenAlexFDO

Authors Ralf Hinze

Publication date 11 September 2015

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

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

zbMATH Keywords

backtrackingcontinuationscutHaskellmonad transformersmonadsprogram derivationProlog

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Backtracking, interleaving, and terminating monad transformers (functional pearl)
• Monad transformers for backtracking search
• Eilenberg-Moore monoids and backtracking monad transformers
• Backtracking with cut via a distributive law and left-zero monoids
• An exercise in transformational programming: Backtracking and Branch-and- Bound

Cited in

(12)

• A divertimento on MonadPlus and nondeterminism
• Specification of logic programming languages from reusable semantic building blocks
• Kleene monads: handling iteration in a framework of generic effects
• Backtracking, interleaving, and terminating monad transformers (functional pearl)
• Counting successes: effects and transformations for non-deterministic programs
• Transactional events
• The Arrow Calculus as a Quantum Programming Language
• Monad transformers for backtracking search
• Eilenberg-Moore monoids and backtracking monad transformers
• Not by equations alone. Reasoning with extensible effects
• Backtracking with cut via a distributive law and left-zero monoids
• From high to low: simulating nondeterminism and state with state

This page was built for publication: Deriving backtracking monad transformers

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