Deriving backtracking monad transformers

DOI10.1145/351240.351258zbMath1321.68195OpenAlexW1970782371MaRDI QIDQ2943369

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

cutHaskellmonadsPrologbacktrackingprogram derivationcontinuationsmonad transformers

Mathematics Subject Classification ID

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

Related Items (9)

Kleene Monads: Handling Iteration in a Framework of Generic Effects ⋮ A divertimento on MonadPlus and nondeterminism ⋮ Counting Successes: Effects and Transformations for Non-deterministic Programs ⋮ Unnamed Item ⋮ Backtracking with cut via a distributive law and left-zero monoids ⋮ Transactional events ⋮ The Arrow Calculus as a Quantum Programming Language ⋮ Specification of Logic Programming Languages from Reusable Semantic Building Blocks ⋮ Not by equations alone: Reasoning with extensible effects

This page was built for publication: Deriving backtracking monad transformers