Backtracking with cut via a distributive law and left-zero monoids
DOI10.1017/S0956796817000077zbMATH Open1418.68063OpenAlexW2734348649MaRDI QIDQ5372012FDOQ5372012
Publication date: 23 October 2017
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796817000077
Recommendations
- Backtracking, interleaving, and terminating monad transformers (functional pearl)
- Deriving backtracking monad transformers
- Eilenberg-Moore monoids and backtracking monad transformers
- Simple operational and denotational semantics for Prolog with cut
- Prolog's control constructs in a functional setting -- axioms and implementation
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Applications of universal algebra in computer science (08A70)
Cites Work
- Title not available (Why is that?)
- Combining effects: sum and tensor
- Title not available (Why is that?)
- Computational effects and operations: an overview
- Title not available (Why is that?)
- Monad transformers as monoid transformers
- Simple operational and denotational semantics for Prolog with cut
- Handling algebraic effects
- Discrete Lawvere theories and computational effects
- Kan Extensions for Program Optimisation Or: Art and Dan Explain an Old Trick
- Deriving backtracking monad transformers
- Title not available (Why is that?)
Cited In (5)
- A functional account of probabilistic programming with possible worlds. Declarative pearl
- A weakly monotonic backward induction algorithm on finite bounded subsets of vector lattices.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Correspondence between composite theories and distributive laws
This page was built for publication: Backtracking with cut via a distributive law and left-zero monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5372012)
