Default rules for Curry

DOI10.1017/S1471068416000168zbMath1379.68037arXiv1605.01352OpenAlexW3104255688MaRDI QIDQ4593082

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

program transformationsemanticsfunctional logic programming

Mathematics Subject Classification ID

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

Related Items (1)

From Logic to Functional Logic Programs

Uses Software

• Haskell
• KiCS2
• Curry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sequential reduction strategy
• Computing in systems described by equations
• Declarative Processing of Semistructured Web Data
• A needed narrowing strategy
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• An approach to declarative programming based on a rewriting logic
• A proof theoretic approach to failure in functional logic programming
• Functional Logic Programming: From Theory to Curry
• Declarative Programming with Function Patterns
• Overlapping Rules and Logic Variables in Functional Logic Programs

This page was built for publication: Default rules for Curry