• Open Access IconOpen Access
  • Cite Icon8
  • https://doi.org/10.1017/s1471068416000168Copy DOI Icon

Default rules for Curry

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

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.

Similar Papers
  • Book Chapter
  • Citations1

Default Rules for Curry

  • Jan 01, 2016
  • Sergio Antoy +1
  • Research Article
  • Citations101

Partial evaluation of functional logic programs

  • Jul 01, 1998
  • ACM Transactions on Programming Languages and Systems
  • María Alpuente +2
  • Research Article
  • Citations24

Specialization of functional logic programs based on needed narrowing

  • May 01, 2005
  • Theory and Practice of Logic Programming
  • María Alpuente +3
  • Conference Article
  • Citations34

Specialization of inductively sequential functional logic programs

  • Sep 01, 1999
  • María Alpuente +3
  • Research Article
  • Citations33

Constructing a bidirectional transformation between BPMN and BPEL with a functional logic programming language

  • Nov 18, 2010
  • Journal of Visual Languages & Computing
  • Steffen Mazanek +1
  • Research Article
  • Citations16

Lazy narrowing with simplification

  • Jul 01, 1997
  • Computer Languages
  • Michael Hanus
  • Research Article

Safe typing of functional logic programs with opaque patterns and local bindings

  • Jan 17, 2014
  • Information and Computation
  • Francisco J López-Fraguas +2
  • PDF
  • Research Article
  • Citations10

The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming

  • Aug 30, 2023
  • Proceedings of the ACM on Programming Languages
  • Lennart Augustsson +7
  • Book Chapter
  • Citations2

A Relational Algebra for Functional Logic Deductive Databases

  • Jan 01, 2004
  • Jesús Manuel Almendros-Jiménez +1
  • Book Chapter
  • Citations8

Introducing Constraint Functional Logic Programming

  • Jan 01, 1992
  • John Darlington +2
  • Dissertation

Implementing a Functional Logic Programming Language via the Fair Scheme

  • May 16, 2023
  • Andrew Jost
  • Book Chapter
  • Citations15

Transforming Functional Logic Programs into Monadic Functional Programs

  • Jan 01, 2011
  • Bernd Braßel +3
  • Book Chapter
  • Citations52

Declarative Programming with Function Patterns

  • Jan 01, 2006
  • Sergio Antoy +1
  • Conference Article

A rewrite-based computational model for functional logic programming

  • Mar 27, 2016
  • EPiC series in computing
  • Mircea Marin +2
  • Research Article
  • Citations29

A proof theoretic approach to failure in functional logic programming

  • Jan 01, 2004
  • Theory and Practice of Logic Programming
  • Francisco J López-Fraguas +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.