PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION

DOI10.1142/S0129054101000436zbMath1319.68053OpenAlexW2155187121WikidataQ114614889 ScholiaQ114614889MaRDI QIDQ5249252

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

zbMATH Keywords

HaskellmonadsPrologaxiomatic semanticscontinuationsmonad transformers

Mathematics Subject Classification ID

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

Related Items

On a Tighter Integration of Functional and Logic Programming, Algebras for combinatorial search, Monadic constraint programming

Uses Software

• Haskell

Cites Work

• Notions of computation and monads
• Simple operational and denotational semantics for Prolog with cut
• Horn clause programs with polymorphic types: Semantics and resolution
• A mathematical definition of full Prolog
• The promotion and accumulation strategies in transformational programming
• Operational and denotational semantics of prolog
• Monadic parsing in Haskell
• The integration of functions into logic programming: From theory to practice
• A system of constructor classes: overloading and implicit higher-order polymorphism