Reasoning Systems, Inc., Palo Alto, California, Refine 2.0 Language Summary, Aug. 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Prototyping Parallel and Distributed Programs in - Proteus Peter Mills (1990) (27 citations) (Correct)
....coupled system containing Crays and Connection Machines linked over a high speed network, whose concurrent parts must currently be programmed following different models. 1.4. Our approach Our language starts with rich data models and operators along the lines of SETL [SDDS86, BDL89] and REFINE [Ref88] which employ the high level mathematical notions of sets, tuples (or sequences) and maps (or relations) We also incorporate metaprogramming capabilities found in REFINE for syntactic language extension and transformation. We then extend this base by allowing statements to be first class ....
Reasoning Systems, Inc., Palo Alto, California, Refine 2.0 Language Summary, Aug. 1988.
Prototyping N-body Simulation in - Proteus Peter Mills (Correct)
....SIMD execution model, while another variant is evolved towards an MIMD execution model. We conclude the paper with a discussion of directions of ongoing research. 2. Basic features of Proteus Our language starts with rich data models and operators along the lines of SETL [SDDS86] and REFINE [Ref88] which employ the high level mathematical notions of sets, sequences, and maps. The core of our language is a conventional imperative notation to the degree that it is assignment based and blockstructured; program state is maintained in typed, lexically scoped variables, and assignment ....
Reasoning Systems, Inc., Palo Alto, California, Refine 2.0 Language Summary, Aug. 1988.
Prototyping High-Performance Parallel Computing.. - Mills, Nyland, Prins.. (1992) (2 citations) Self-citation (California) (Correct)
....as well as progress constraints which abstractly specify the distribution of computational resources. We conclude the paper with a discussion of ongoing research. 2. Basic features of Proteus Our language starts with rich data models and operators along the lines of SETL [SDDS86] and REFINE [Ref88] which employ the high level mathematical notions of sets, sequences, and maps. The core of our language is a conventional imperative notation to the degree that it is assignment based and blockstructured; program state is maintained in typed, lexically scoped variables, and assignment ....
Reasoning Systems, Inc., Palo Alto, California, Refine 2.0 Language Summary, Aug. 1988.
Rate-Control as a Language Construct for Parallel and.. - Peter Mills Jan (1993) Self-citation (Systems California) (Correct)
....place it in a restricted form that can be translated directly to a low level machinespecific parallel language. The source to source transformations and translation can be managed semiautomatically by the analysis and theorem proving capabilities of KIDS (Kestrel Interactive Development System) Ref88, Smi90] For example, we have investigated refinement strategies that transform a broad class of high level data parallel operations over sequences into the widely portable vector language CVL. The language and transformation techniques are also being used to prototype sophisticated parallel ....
....used in molecular dynamics simulations [MNPR92] We describe here only a few salient features of Proteus. The Proteus language employs as its principle data types the high level mathematical notions of sets, sequences, and maps, in a manner similar to such languages as SETL [SDDS86] and REFINE [Ref88] Sequence (similarly set) comprehension refers to the construction of a sequence by generation based on another sequence, of the form: expr(x) x in S j pred(x) Sequences can also be constructed by enumeration. Proteus provides a succinct yet powerful set of primitives for the parallel ....
Reasoning Systems, Inc., Palo Alto, California, Refine 2.0 Language Summary, Aug. 1988.
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