Prolog's control constructs in a functional setting -- axioms and implementation
From MaRDI portal
Publication:5249252
DOI10.1142/S0129054101000436zbMATH Open1319.68053OpenAlexW2155187121WikidataQ114614889 ScholiaQ114614889MaRDI QIDQ5249252FDOQ5249252
Authors: Ralf Hinze 
Publication date: 30 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054101000436
Recommendations
Cites Work
- Notions of computation and monads
- Simple operational and denotational semantics for Prolog with cut
- The integration of functions into logic programming: From theory to practice
- Horn clause programs with polymorphic types: Semantics and resolution
- Operational and denotational semantics of prolog
- The promotion and accumulation strategies in transformational programming
- A system of constructor classes: overloading and implicit higher-order polymorphism
- A mathematical definition of full Prolog
- Monadic parsing in Haskell
Cited In (10)
- Backtracking with cut via a distributive law and left-zero monoids
- Backtracking, interleaving, and terminating monad transformers (functional pearl)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monadic constraint programming
- Algebras for combinatorial search
- Modelling Prolog Control
- Title not available (Why is that?)
- On a Tighter Integration of Functional and Logic Programming
Uses Software
This page was built for publication: Prolog's control constructs in a functional setting -- axioms and implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249252)
