F.S. Taylor. Parallel Functional Programming by Partitioning. PhD thesis, Department of Computing, Imperial College, London, 1997. URL: http://www.lieder.demon.co.uk/thesis/thesis.ps.gz. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Topological Skeletons in Haskell# - Junior, al. (2003) (Correct)
....patterns, called algorithmic skeletons. Skeletons allow for abstracting concurrency aspects from implementation issues on target architectures. Besides that, they turn programming more modular and improve reuse of code. Many languages have incorporated facilities to define and reuse skeletons[3, 4, 5, 6, 7, 8]. Haskell # [9, 10] is a coordination language [11] that extends Haskell[12] a modern functional programming language. It was first designed for high performance parallel distributed programming on clusters of PC s [13] Haskell # was shown expressive enough for the specification of a wider ....
F. Taylor, "Parallel Functional Programming by Partitioning", PhD Thesis, Department of Computing, Imperial College of Science, Technology and Medicine, University of London, Jan. 1997.
Coordinating Functional Processes with Haskell# - Carvalho, Jr., Lima, Lins (2002) (Correct)
....coordination and parallel functional programming can be seen from twoperspectives. In the first one, coordination is considered an important tool for parallel functional languages and models, because of its ability to abstract parallel concerns from specification of computation. Eden[2] and Caliban[19, 31] are examples of languages focused ontheseideas. In the last one, higher order and non strict style of functional programming has been seen as an powerfull way to specify coordination amongst tasks. SCL[8] and Delirium[24] are examples of languages that use the functional paradigm at coordination ....
F. Taylor. Parallel Functional Programming by Partitioning. PhD Thesis, Department of Computing, Imperial College of Science, Technology and Medicine, University of London,Jan. 1997.
Parallelizing MCP-Haskell for Evaluating Haskel#.. - Carvalho, Jr., Lins.. (2001) (Correct)
....III. Haskell# COMPARED TO OTHERS PARALLEL FUNCTIONAL LANGUAGES BASED ON COORDINATION In the context of parallel functional languages, Haskell# belongs to the class of coordination based ones. Other important examples of this class are Eden[Breitinger et al. 1997] and Caliban[Kelly, 1989, Taylor, 1997] Like Haskell# , Both uses Haskell for specifying computation and assume a static network where functional processes communicate via point to point and unidirectional channels. Caliban also provides annotations for specifying placement of processes, while Eden has facilities for specification of ....
Taylor, F. (1997). Parallel Functional Programming by Partitioning. PhD Thesis, Department of Computing, Imperial College of Science, Technology and Medicine, University of London, Jan.
Coordinating Functional Processes with Haskell# - Carvalho, Jr., Lima (2002) (Correct)
....coordination and parallel functional programming can be seen from two perspectives. In the rst one, coordination is considered an important tool for parallel functional languages and models, because of its ability to abstract parallel concerns from speci cation of computation. Eden[2] and Caliban[19, 31] are examples of languages focused on these ideas. In the last one, higher order and non strict style of functional programming has been seen as an powerfull way to specify coordination amongst tasks. SCL[8] and Delirium[24] are examples of languages that use the functional paradigm at ....
F. Taylor. Parallel Functional Programming by Partitioning. PhD Thesis, Department of Computing, Imperial College of Science, Technology and Medicine, University of London, Jan. 1997.
GpH: An Architecture-independent Functional Language - Trinder, Barry, Jr.. (1998) (2 citations) (Correct)
....In the absence of dynamic load balancing, however, a highly regular program may be required if starvation is to be avoided. Caliban: Most parallel functional language systems have favoured either paradigmatic or dynamic approaches. One influential exception is Caliban Advanced Caliban [Kel89, Tay97] which is intended to target loosely coupled multiprocessors. The Caliban language adds the concept of moreover clauses to a conventional functional language (most recently a subset of Haskell [Tay93] These clauses specify behavioural information. While there is consequently a superficial ....
F.S. Taylor, Parallel Functional Programming by Partitioning, PhD Thesis, Department of Computing, Imperial College, London, 1997.
Engineering Parallel Symbolic Programs in GpH - Loidl, Trinder, Hammond.. (1999) (5 citations) (Correct)
No context found.
F.S. Taylor. Parallel Functional Programming by Partitioning. PhD thesis, Department of Computing, Imperial College, London, 1997. URL: http://www.lieder.demon.co.uk/thesis/thesis.ps.gz.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC