Constructor-based conditional narrowing

Antoy, Sergio

doi:10.1145/773184.773205

Cited by 53 publications

(76 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Uniform programs have a simple form of pattern matching: either a function is defined by a single rule without pattern matching, or it is defined by rules with only one constructor in the left-hand side of each rule, and in the same argument for all rules. 3 For instance, the operation xor defined above can be transformed into the following uniform program: In particular, there are no overlapping rules for functions (except for the choice operation "?" which is considered as predefined).…”

Section: Curry Programsmentioning

confidence: 99%

KiCS2: A New Compiler from Curry to Haskell

Braßel

Hanus

Peemöller

et al. 2011

Functional and Constraint Logic Programming

View full text Add to dashboard Cite

Abstract. In this paper we present our first steps towards a new system to compile functional logic programs of the source language Curry into purely functional Haskell programs. Our implementation is based on the idea to represent non-deterministic results as values of the data types corresponding to the results. This enables the application of various search strategies to extract values from the search space. We show by several benchmarks that our implementation can compete with or outperform other existing implementations of Curry.

show abstract

Section: Curry Programsmentioning

confidence: 99%

KiCS2: A New Compiler from Curry to Haskell

Braßel

Hanus

Peemöller

et al. 2011

Functional and Constraint Logic Programming

View full text Add to dashboard Cite

show abstract

“…More precisely, every function of an overlapping inductively sequential system can be represented by a particular variety of definitional tree [2,3], which we specify in Section 3.7. It is shown in [4] that every functional logic program defined by constructor-based rewrite rules, including programs in the functional logic languages Curry and T OY, can be transformed into an overlapping inductively sequential system. This class properly includes the first-order programs of the functional languages ML and Haskell.…”

Section: Overlapping Inductively Sequential Rewrite Systemsmentioning

confidence: 99%

“…The MAKETERM instruction, which is parameterized by the symbol being applied, replaces these arguments with the application term. For example, the term [1,2]++ [3,4], which is a narrex, is replaced by 1:([2]++ [3,4]) which is constructed as follows. First, the handles for the terms [3,4] and [2] are pushed on the pre-term stack.…”

Section: Storage Areasmentioning

confidence: 99%

“…For example, the term [1,2]++ [3,4], which is a narrex, is replaced by 1:([2]++ [3,4]) which is constructed as follows. First, the handles for the terms [3,4] and [2] are pushed on the pre-term stack. Executing "MAKETERM ++" replaces them with a handle to the new term [2]++ [3,4].…”

Section: Storage Areasmentioning

confidence: 99%

“…First, the handles for the terms [3,4] and [2] are pushed on the pre-term stack. Executing "MAKETERM ++" replaces them with a handle to the new term [2]++ [3,4]. Then, the handle for the term 1 is pushed on the stack as well and executing "MAKETERM :" replaces the two topmost elements with a handle for 1:([2]++ [3,4]).…”

Section: Storage Areasmentioning

confidence: 99%

See 2 more Smart Citations

A Virtual Machine for Functional Logic Computations

Antoy

Hanus

Liu

et al. 2005

Implementation and Application of Functional Languages

Self Cite

View full text Add to dashboard Cite

Abstract.We describe the architecture of a virtual machine for executing functional logic programming languages. A distinguishing feature of our machine is that it preserves the operational completeness of non-deterministic programs by concurrently executing a pool of independent computations. Each computation executes only root-needed sequential narrowing steps. We describe the machine's architecture and instruction set, and show how to compile overlapping inductively sequential programs to sequences of machine instructions. The machine has been implemented in Java and in Standard ML.

show abstract