Download:
|
by Elvira Albert, Sergio Antoy
http://www.cs.pdx.edu/~antoy/homepage/./papers/lopstr00/full.ps.gz
Add To MetaCart
Abstract:
Abstract. We introduce a framework for assessing the eectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models a functional logic program. Consequently, our assessment is independent of any specic language implementation or computing environment. We dene several criteria for measuring the cost of a computation: number of steps, number of function applications, and pattern matching eort. Most importantly, we express the cost of each criterion by means of recurrence equations over algebraic data types, which can be automatically inferred from the partial evaluation process itself. In some cases, the equations can be solved by transforming their arguments from arbitrary data types to natural numbers. In other cases, it is possible to estimate the improvement of a partial evaluation by analyzing the associated cost recurrence equations. 1
Citations
|
2004
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
606
|
Term Rewriting and All That
– Baader, Nipkow
- 1998
|
|
552
|
Partial evaluation and automatic program generation
– Jones, Gomard, et al.
- 1993
|
|
333
|
The integration of functions into logic programming: from theory to practice
– Hanus
- 1994
|
|
288
|
M.: A needed narrowing strategy
– Antoy, Echahed, et al.
- 2000
|
|
242
|
Tutorial notes on partial evaluation
– Consel, Danvy
- 1993
|
|
176
|
Logic Programming with Functions and Predicates: The Language BABEL
– Moreno-Navarro, Rodríguez-Artalejo
- 1992
|
|
144
|
Tutorial on specialisation of logic programs
– Gallagher
- 1993
|
|
112
|
Kernel Leaf: A Logic plus Functional Language
– Giovannetti, Levi, et al.
- 1991
|
|
103
|
TOY: A Multiparadigm Declarative System
– López-Fraguas, Sánchez-Hernández
- 1999
|
|
102
|
M.: A demand driven computation strategy for lazy narrowing
– Loogen, López-Fraguas, et al.
- 1993
|
|
84
|
Cost analysis of logic programs
– Debray, Lin
- 1993
|
|
77
|
Narrowing-driven partial evaluation of functional logic programs
– Alpuente, Falaschi, et al.
- 1996
|
|
63
|
Automatic complexity analysis
– Rosendahl
|
|
62
|
A positive supercompiler
– Sorenson, Gluck, et al.
- 1996
|
|
56
|
Total correctness by local improvement in the transformation of functional programs
– Sands
- 1996
|
|
38
|
A na"ive time analysis and its theory of cost equivalence
– Sands
- 1995
|
|
37
|
Waal. A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration
– Leuschel, Schreye, et al.
- 1996
|
|
32
|
Automatic accurate time-bound analysis for high-level languages
– Liu, Gomez
- 1998
|
|
23
|
Indy User's Manual
– Albert, Alpuente, et al.
- 1998
|
|
22
|
De trees
– Antoy
- 1992
|
|
22
|
Partial evaluation, self-application and types
– Jones
- 1990
|
|
19
|
Speedup Analysis in Partial Evaluation (Prelimi-nary Results
– Andersen, Gomard
- 1992
|
|
17
|
Using an Abstract Representation to Specialize Functional Logic Programs
– Albert, Hanus, et al.
- 1955
|
|
13
|
A Constraint-based Partial Evaluator for Functional Logic Programs and its Application
– Lafave
- 1998
|
|
13
|
Turchin's supercompiler revisited: An operational theory of positive information propagation
– Srensen
- 1994
|
|
12
|
A Formal Type System for Comparing Partial Evaluators
– Nielson
- 1988
|
|
11
|
Properties of Unfolding-based Meta-level Systems
– Amtoft
- 1991
|
|
9
|
Formally Based Pro for Higher-Order Functional Languages
– Sansom, Peyton-Jones
- 1997
|
|
8
|
The Hugs 98 User Manual. Available at http://haskell.cs.yale.edu/hugs
– Jones, Reid
- 1998
|
