Prolog's control constructs in a functional setting -- axioms and implementation
From MaRDI portal
Publication:5249252
Recommendations
Cites work
- A mathematical definition of full Prolog
- A system of constructor classes: overloading and implicit higher-order polymorphism
- Horn clause programs with polymorphic types: Semantics and resolution
- Monadic parsing in Haskell
- Notions of computation and monads
- Operational and denotational semantics of prolog
- Simple operational and denotational semantics for Prolog with cut
- The integration of functions into logic programming: From theory to practice
- The promotion and accumulation strategies in transformational programming
Cited in
(10)- Backtracking with cut via a distributive law and left-zero monoids
- Backtracking, interleaving, and terminating monad transformers (functional pearl)
- scientific article; zbMATH DE number 1980921 (Why is no real title available?)
- scientific article; zbMATH DE number 4013995 (Why is no real title available?)
- scientific article; zbMATH DE number 3956407 (Why is no real title available?)
- Monadic constraint programming
- Algebras for combinatorial search
- Modelling Prolog Control
- scientific article; zbMATH DE number 1543356 (Why is no real title available?)
- On a Tighter Integration of Functional and Logic Programming
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)