Kernel-LEAF: A logic plus functional language

Giovannetti, Elio; Levi, Giorgio; Moiso, Corrado; Palamidessi, Catuscia

doi:10.1016/0022-0000(91)90009-t

Cited by 88 publications

(69 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Similarly to the notion of result values, this is intended in programming languages where an equation between functional expressions that do not have a value, like "idNil [1] =:= idNil [1]", is usually not considered as true. Furthermore, normal forms or values might not exist so that reflexivity is not a feasible property of equational constraints (see [34] for a more detailed discussion on this topic).…”

Section: Example 1 Consider the Operation Idnil [] = []mentioning

confidence: 99%

Multi-paradigm Declarative Languages

Hanus¹

Logic Programming

View full text Add to dashboard Cite

Abstract. Declarative programming languages advocate a programming style expressing the properties of problems and their solutions rather than how to compute individual solutions. Depending on the underlying formalism to express such properties, one can distinguish different classes of declarative languages, like functional, logic, or constraint programming languages. This paper surveys approaches to combine these different classes into a single programming language.

show abstract

Section: Example 1 Consider the Operation Idnil [] = []mentioning

confidence: 99%

Multi-paradigm Declarative Languages

Hanus¹

Logic Programming

View full text Add to dashboard Cite

show abstract

“…In order to avoid unnecessary computations and to deal with infinite data structures, a demand-driven generation of the search space has been advocated by a number of lazy narrowing strategies [10][11][12]. Due to its optimality properties w.r.t.…”

Section: Semanticsmentioning

confidence: 99%

Ensuring the quasi-termination of needed narrowing computations

Ramos¹,

Silva

Vidal

2007

Information Processing Letters

View full text Add to dashboard Cite

“…In order to avoid unnecessary computations and to deal with infinite data structures, demand-driven generation of the search space has been advocated by a number lazy narrowing strategies (Giovannetti et al, 1991;Loogen et al, 1993;Moreno-Navarro and Rodríguez-Artalejo, 1992). Due to its optimality properties w.r.t.…”

Section: Narrowingmentioning

confidence: 99%

Cost-Augmented Partial Evaluation of Functional Logic Programs

Vidal

2004

Higher-Order and Symbolic Computation

View full text Add to dashboard Cite

Abstract. We enhance the narrowing-driven partial evaluation scheme for lazy functional logic programs with the computation of symbolic costs. The enhanced scheme allows us to estimate the effects of the program transformer in a precise framework and, moreover, to quantify these effects. The considered costs are "symbolic" in the sense that they measure the number of basic operations performed during a computation rather than actual execution times. Our scheme may serve as a basis to develop speedup analyses and cost-guided transformers. A cost-augmented partial evaluator, which demonstrates the usefulness of our approach, has been implemented in the multi-paradigm language Curry.

show abstract

Kernel-LEAF: A logic plus functional language

Cited by 88 publications

References 13 publications

Multi-paradigm Declarative Languages

Multi-paradigm Declarative Languages

Ensuring the quasi-termination of needed narrowing computations

Cost-Augmented Partial Evaluation of Functional Logic Programs

Contact Info

Product

Resources

About