From Logic to Functional Logic Programs

DOI10.1017/S1471068422000187MaRDI QIDQ5038460

Michael Hanus

Publication date: 30 September 2022

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.06841

zbMATH Keywords

transformationresolutionfunctional logic programmingnarrowing strategies

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• Haskell
• KiCS2
• Mercury
• Curry
• TOY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mercury
• An overview of Ciao and its design philosophy
• Declarative Processing of Semistructured Web Data
• Analysis of residuating logic programs
• A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems
• A needed narrowing strategy
• Compiling control
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• The execution algorithm of mercury, an efficient purely declarative logic programming language
• Default rules for Curry
• An approach to declarative programming based on a rewriting logic
• Term Rewriting and All That
• A technique for doing lazy evaluation in logic
• Functional Logic Programming: From Theory to Curry
• Declaring Numbers
• Towards Typed Prolog
• Data type inference for logic programming

This page was built for publication: From Logic to Functional Logic Programs