Deriving backtracking monad transformers

DOI10.1145/351240.351258zbMATH Open1321.68195OpenAlexW1970782371MaRDI QIDQ2943369FDOQ2943369

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

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

zbMATH Keywords

cutmonadsbacktrackingprogram derivationPrologcontinuationsHaskellmonad transformers

Mathematics Subject Classification ID

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

Cited In (11)

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

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)