Parallel programming with data structures and higher order functions
نویسندگان
چکیده
منابع مشابه
Constraint Imperative Programming with Higher-order Functions
In constraint programming, programs are written by mainly specifying the properties which must hold for a solution of a given problem. In contrast, imperative programming languages require that the programmer explicitly specifies each state transition a program must perform in order to calculate the solution. This paper describes a programming style which consists of these both views as well as...
متن کاملHigher Order Functions Considered Unnecessary for Higher Order Programming
It is often claimed that the essence of functional programming is the use of functions as values, i.e., of higher order functions, and many interesting examples have been given showing the power of this approach. Unfortunately, the logic of higher order functions is diicult, and in particular, higher order uniication is undecidable. Moreover (and closely related), higher order expressions are n...
متن کاملHopp - a Higher-order Parallel Programming Model
The eecient programming of parallel computers is still a diicult task. This paper focuses on studying methods for expressing parallelism in programs without making the programmer explicitly responsible for parallelism. Parallel programming using a set of useful implicitly-parallel constructs is considered. These constructs are borrowed from FP and the Bird-Meertens approach. Programs are analys...
متن کاملConcrete data structures and functional parallel programming
We present a framework for designing parallel programming languages whose semantics is functional and where communications are explicit. To this end, we specialize Brookes and Geva's generalized concrete data structures with a notion of explicit data layout and obtain a CCC of distributed structures called arrays. We nd that arrays' symmetric replicated structures, suggested by the data-paralle...
متن کاملProgramming with Higher-Order Logic
Formal systems that describe computations over syntactic structures occur frequently in computer science. Logic programming provides a natural framework for encoding and animating such systems. However, these systems often embody variable binding, a notion thatmust be treated carefully at a computational level. This book aims to show that a programming language based on a simply typed version o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1992
ISSN: 0167-6423
DOI: 10.1016/0167-6423(92)90032-7