Backtracking, interleaving, and terminating monad transformers

DOI10.1145/1086365.1086390zbMath1302.68061OpenAlexW1979039632WikidataQ56115130 ScholiaQ56115130MaRDI QIDQ2936782

Oleg Kiselyov, Daniel P. Friedman, Chung-Chieh Shan, Amr Sabry

Publication date: 6 January 2015

Published in: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1086365.1086390

zbMATH Keywords

Haskelllogic programmingPrologcontinuationsstreamscontrol delimiters

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Related Items

Kleene Monads: Handling Iteration in a Framework of Generic Effects, Scheduling complexity of interleaving search, A functional account of probabilistic programming with possible worlds. Declarative pearl, Unnamed Item, Unnamed Item, Transactional events, A static simulation of dynamic delimited control, Unnamed Item, Algebras for combinatorial search, α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic, Resourceful program synthesis from graded linear types