List - Processing Optimizations in Curry ? Elvira Albert 1 , C
نویسندگان
چکیده
The multi-paradigm language Curry integrates features from functional, logic, and concurrent programming. In this work, we consider two well-known list-processing optimizations: short cut deforestation (from functional programming) and diierence-lists (from logic programming), and study their adaptation to our integrated setting. While short cut deforestation adapts smoothly, the use of diierence-lists in Curry is impractical due to the absence of non-strict equality in the language. Despite all, we have developed a novel transformation which achieves a similar effect over functional logic programs. Both transformations combined together yield a simple and practical method for optimizing list-processing programs.
منابع مشابه
A Practical Partial Evaluator for aMulti - Paradigm Declarative Language ? Elvira Albert
Partial evaluation is an automatic technique for program optimization which preserves program semantics. The range of its potential applications is extremely large, as witnessed by successful experiences in several elds. This paper summarizes our ndings in the development of partial evaluation tools for Curry, a modern multi-paradigm declarative language which combines features from functional,...
متن کاملA Practical Partial Evaluation Scheme for Multi-Paradigm Declarative Languages
We present a practical partial evaluation scheme for multi-paradigm declarative languages combining features from functional, logic, and concurrent programming. In contrast to previous approaches, we consider an intermediate representation for programs into which source programs can be automatically translated. The use of this simplified representation, together with the appropriate control iss...
متن کاملA Partial Evaluation Framework for Curry Programs
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays to functional logic programs. We show how to lift the nondeterministic choices from run time to specialization time. We ascertain the conditions under which the original and the transformed program have the same answ...
متن کاملSpecialization of Functional Logic Programswith Dynamic Scheduling ?
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays to functional logic programs. We show how to lift the nondeterministic choices from run time to specialization time. We ascertain the conditions under which the original and the transformed program have the same answ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000