Backtracking with cut via a distributive law and left-zero monoids
From MaRDI portal
Publication:5372012
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
Cites work
- scientific article; zbMATH DE number 3904807 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 3296291 (Why is no real title available?)
- Combining effects: sum and tensor
- Computational effects and operations: an overview
- Deriving backtracking monad transformers
- Discrete Lawvere theories and computational effects
- Eilenberg-Moore monoids and backtracking monad transformers
- Handling algebraic effects
- Kan extensions for program optimisation Or: Art and Dan explain an old trick
- Monad transformers as monoid transformers
- Simple operational and denotational semantics for Prolog with cut
Cited in
(6)- Deriving backtracking monad transformers
- scientific article; zbMATH DE number 7559448 (Why is no real title available?)
- A weakly monotonic backward induction algorithm on finite bounded subsets of vector lattices.
- scientific article; zbMATH DE number 7471702 (Why is no real title available?)
- A functional account of probabilistic programming with possible worlds. Declarative pearl
- 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)