Reduction Strategies for Declarative Programming
نویسندگان
چکیده
منابع مشابه
Reduction Strategies for Declarative Programming
This paper surveys reduction or evaluation strategies for functional and functional logic programs. Reasonable reduction strategies for declarative languages must be efficiently implementable to be useful in practice. On the other hand, they should also support the programmers to write programs in a declarative way ignoring the influence of the evaluation strategy to the success of a computatio...
متن کاملDeclarative Programming for Modular Robots
Because of the timing, complexity, and asynchronicity challenges common in modular robot software we have recently begun to explore new programming models for modular robot ensembles. In this paper we apply two of those models to a metamodule-based shape planning algorithm and comment on the differences between the two approaches. Our results suggest that declarative programming can provide sev...
متن کاملDeclarative Parallel Programming for GPUs
The recent rise in the popularity of Graphics Processing Units (GPUs) has been fueled by software frameworks, such as NVIDIA’s Compute Unified Device Architecture (CUDA) and Khronos Group’s OpenCL that make GPUs available for general purpose computing. However, CUDA and OpenCL are still lowlevel approaches that require users to handle details about data layout and movement across levels of memo...
متن کاملEditorial Reduction strategies in rewriting and programming
Reduction strategies in rewriting and programming have attracted increasing attention within the last few years. New types of reduction strategy have been invented and investigated, and new results on rewriting/computation under particular strategies have been obtained. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application an...
متن کاملLogical Foundations for Declarative Object-oriented Programming Logical Foundations for Declarative Object-oriented Programming ?
We present a formalism for reasoning about declarative object-oriented programs. Classes are represented as rst-order theories that contain logic programs as methods. Inheritance, genericity and related concepts are represented by operations on such theories which preserve the consistency of these theories as well as the correctness of the programs speciied by their axioms. Our approach provide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00273-7