Relating models of backtracking

DOI10.1145/1016850.1016861MaRDI QIDQ5178022zbMATH OpenOpenAlexFDO

Authors Mitchell Wand, Dale Vaillancourt

Publication date 9 March 2015

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

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

zbMATH Keywords

adequacylogical relationsmonadsstreamstwo-continuation semantics

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Toward the concept of backtracking computation
• Lazy Relations
• A model-theoretic reconstruction of the operational semantics of logic programs
• Axiomatizations of backtracking
• Toward a model for backtracking and dynamic programming

Cited in

(8)

• Backing backtracking
• Toward the concept of backtracking computation
• Back and Forth between Rules and SE-Models
• Worker/Wrapper Transformation
• Codensity lifting of monads and its dual
• Eilenberg-Moore monoids and backtracking monad transformers
• Bisimulations for delimited-control operators
• Logical Relations for PCF

This page was built for publication: Relating models of backtracking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178022)