The narrowing-driven approach to functional logic program specialization

New Generation Computing

Volumn 20, Issue 1, 2002, Pages 3-26

  Albert, Elvira ^a   Vidal, Germán ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Narrowing; Partial evaluation; Program optimization

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; LOGIC PROGRAMMING; OPTIMIZATION; SEMANTICS;

FUNCTIONAL LOGIC PROGRAMMING; NARROWING DRIVEN APPROACH; PARTIAL EVALUATION; PROGRAM OPTIMIZATION; PROGRAM SPECIALIZATION; SYMBOLIC COMPUTATION;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 0036242531     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037257     Document Type: Article

References (61)

1. The universal resolving algorithm: Inverse computation in a functional language
2. Improving control in functional logic program specialization
3. A partial evaluation framework for curry programs
4. Measuring the effectiveness of partial evaluation in functional logic languages
5. Using an abstract representation to specialize functional logic programs
6. A practical partial evaluator for a multi-paradigm declarative language
7. Specialization of lazy functional logic programs
8. Narrowing-driven partial evaluation of functional logic programs
9. Partial evaluation of functional logic programs
10. Specialization of inductively sequential functional logic programs
11. Definitional trees
12. A needed narrowing strategy
13. Loop checking in partial deduction
14. A self-applicable partial evaluator for term rewriting systems
15. A general criterion for avoiding infinite unfolding
16. A transformation system for developing recursive programs
17. Tutorial notes on partial evaluation
18. A program development methodology based on a unified approach to execution and transformation
19. Conjunctive partial deduction: Foundations, control, algorithms, and experiments
20. A transformation system for CLP with dynamic scheduling and CCP
21. SLOG: A logic programming language interpreter based on clausal superposition and rewriting
22. Partial evaluation of computation process-an approach to a compiler-compiler
23. Tutorial on specialization of logic programs
24. Kernel leaf: A logic plus functional language
25. Occam's razor in metacomputation: The notion of a perfect process tree
26. Partial deduction and driving are equivalent
27. The integration of functions into logic programming: From theory to practice
28. A unified computation model for functional and logic programming
29. Higher-order narrowing with definitional trees
30. Curry: An integrated functional logic language
31. An abstract machine based system for a lazy narrowing calculus
32. Computations in orthogonal rewriting systems, Part I + II
33. Canonical forms and unification
34. Mix: A self-applicable partial evaluator for experiments in compiler generation
35. Term rewriting systems
36. Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture
37. Partial evaluation of functional logic programs in rewriting-based languages
38. Unification revisited
39. On the power of homeomorphic embedding for online termination
40. A conceptual embedding of folding into partial deduction: Towards a maximal integration
41. Controlling generalization and polyvariance in partial deduction of normal logic programs
42. Partial evaluation in logic programming
43. A demand driven computation strategy for lazy narrowing
44. TOY: A multiparadigm declarative system
45. An efficient abstract machine for curry
46. Ensuring global termination of partial deduction while allowing flexible polyvariance
47. Logic programming with functions and predicates: The language Babel
48. A self-applicable supercompiler
49. A comparative revisitation of some program transformation techniques
50. Narrowing as the operational semantics of functional languages
51. Automated theorem-proving for theories with simplifiers, commutativity and associativity
52. Turchin's supercompiler revisited: An operational theory of positive information propagation
53. An algorithm for generalization in positive supercompilation
54. A positive supercompiler
55. The concept of a supercompiler
56. Semantics-based analysis and transformation of functional logic programs