Default rules for Curry

DOI10.1017/S1471068416000168MaRDI QIDQ4593082zbMATH OpenOpenAlexFDO

Authors Sergio Antoy, Michael Hanus

Publication date 9 November 2017

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

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

zbMATH Keywords

functional logic programmingprogram transformationsemantics

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Abstract: In functional logic programs, rules are applicable independently of textual order, i.e., any rule can potentially be used to evaluate an expression. This is similar to logic languages and contrary to functional languages, e.g., Haskell enforces a strict sequential interpretation of rules. However, in some situations it is convenient to express alternatives by means of compact default rules. Although default rules are often used in functional programs, the non-deterministic nature of functional logic programs does not allow to directly transfer this concept from functional to functional logic languages in a meaningful way. In this paper we propose a new concept of default rules for Curry that supports a programming style similar to functional programming while preserving the core properties of functional logic programming, i.e., completeness, non-determinism, and logic-oriented use of functions. We discuss the basic concept and propose an implementation which exploits advanced features of functional logic languages.

Recommendations

• Logics in Artificial Intelligence
• Functional Logic Programming: From Theory to Curry
• Overlapping Rules and Logic Variables in Functional Logic Programs
• scientific article; zbMATH DE number 1942452
• Semantic determinism and functional logic program properties

Cites work

• A needed narrowing strategy
• A proof theoretic approach to failure in functional logic programming
• A sequential reduction strategy
• An approach to declarative programming based on a rewriting logic
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Computing in systems described by equations
• Declarative processing of semistructured web data
• Declarative Programming with Function Patterns
• Functional Logic Programming: From Theory to Curry
• scientific article; zbMATH DE number 5007864 (Why is no real title available?)
• scientific article; zbMATH DE number 1088020 (Why is no real title available?)
• scientific article; zbMATH DE number 1952947 (Why is no real title available?)
• scientific article; zbMATH DE number 867332 (Why is no real title available?)
• Overlapping Rules and Logic Variables in Functional Logic Programs

Cited in

(1)

• From Logic to Functional Logic Programs

Describes a project that uses

Uses Software

• Haskell
• KiCS2
• Curry

This page was built for publication: Default rules for Curry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593082)