Transforming Functional Logic Programs into Monadic Functional Programs

DOI10.1007/978-3-642-20775-4_2zbMath1327.68060OpenAlexW60003963MaRDI QIDQ3003513

Michael Hanus, Fabian Reck, Sebastian Fischer, Bernd Braßel

Publication date: 27 May 2011

Published in: Functional and Constraint Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20775-4_2

Mathematics Subject Classification ID

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

Related Items (1)

An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry

Uses Software

• Haskell
• TOY
• PAKCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evaluation strategies for functional logic programming
• Purely functional lazy non-deterministic programming
• Multi-paradigm Declarative Languages
• A Fully Abstract Semantics for Constructor Systems
• Nondeterministic algebraic specifications and nonconfluent term rewriting
• Higher-order narrowing with definitional trees
• An approach to declarative programming based on a rewriting logic
• A Virtual Machine for Functional Logic Computations
• Overlapping Rules and Logic Variables in Functional Logic Programs

This page was built for publication: Transforming Functional Logic Programs into Monadic Functional Programs