Backtracking with cut via a distributive law and left-zero monoids

DOI10.1017/S0956796817000077zbMath1418.68063OpenAlexW2734348649MaRDI QIDQ5372012

Sam Staton, Maciej Piróg

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

zbMATH Keywords

algebraic effectslist monad

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Applications of universal algebra in computer science (08A70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monad transformers as monoid transformers
• Discrete Lawvere theories and computational effects
• Simple operational and denotational semantics for Prolog with cut
• Combining effects: sum and tensor
• Handling Algebraic Effects
• Kan Extensions for Program Optimisation Or: Art and Dan Explain an Old Trick
• Deriving backtracking monad transformers

This page was built for publication: Backtracking with cut via a distributive law and left-zero monoids