HALSTEAD, JR., R. H. Multilisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct. 1985), 501--538. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Compiler Approach to Scalable Concurrent Program Design - Foster, Taylor (1992) (11 citations) (Correct)
.... of an architecturally independent model of parallel computation have been widely recognized in the computer science community [29, 28, 25, 1, 7] The notion of monotonicity is at the heart of several such programming models, notably concurrent logic programming [11, 24] functional programming [28, 26, 9], and object oriented programming [1] Similarly, concurrent composition underlies such diverse approaches as CSP [29] concurrent logic programming, functional programming, and Unity [7] Unfor tunately, these models either do not support concurrent source to source transformations or embed the ....
Halstead, R., Multilisp - A language for concurrent symbolic computation, ACM Trans. Prog. Lang. Syst., 7(4), 501-538, 1985.
High Level Support for Distributed High Performance Computing - Laure (2001) (Correct)
.... data based synchronization (i.e. implicit synchronization when results of an asynchronous request are being accessed) but also control based synchronization that is independent of any data access (by testing or waiting on an event) In that respect, events are comparable to Multilisp s Futures [102], but differ from Futures in similar Java systems [39, 119] that only provide data based synchronization. SDA Equivalence. The equals method performs an equality check among two objects of class SDA. Specifically, true is returned if the argument object refers to the same remote SDA object as the ....
R. Halstead. Multilisp: A Language for Concurrent Symbolic Computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, 1985.
A Concurrent Lambda Calculus with Futures - Niehren, Schwinghammer, Smolka (2005) (Correct)
....[14] Most concurrent extensions of Standard ML so far are based on channels [18, 17] Only recently, a new concurrent extension of ML was proposed [1] where all synchronisation is based on futures. A future is a transparent placeholder for a value; it disappears once its value becomes available [4, 7]. Operations may block until the value of a future becomes known. This form of data driven synchronisation is invoked automatically and as late as possible, so that the potential for concurrent computation is maximised. Several lambda calculi with futures were studied previously [6, 15] mainly ....
....concurrent computation is maximised. Several lambda calculi with futures were studied previously [6, 15] mainly in order to model parallel execution of purely functional programs. These calculi are all untyped. They add an operator to the lambda calculus modeling the future operator of MultiLisp [7]. This operator introduces futures whose values will be computed in independent concurrent threads. Concurrent functional computation with indeterministic communication cannot be modeled by these lambda calculi with future, as they are restricted to preserve con uence [6] In order to solve this ....
[Article contains additional citation context not shown here]
R. H. Halstead, Jr. Multilisp: A Language for Concurrent Symbolic Computation. ACM Transactions on Programming Languages and Systems, 7(4):501-538, Oct. 1985.
Typed Concurrent Programming with Logic Variables - Müller, Niehren, Smolka (Correct)
.... meaning: Modes have described the instantiation state of procedure arguments (such as ground, non ground, free) directly before or before and after application [4, 11, 35] or guaranteed point to point communication [17, 33, 38] In concurrent functional languages, synchronization based on futures [14] or I structures [2] in Id comes close to data driven synchronization based on logic variables. In contrast to futures, logic variables are created independently from the thread that will bind it. In contrast to logic variables and similar to channels, both futures and I structures require ....
R. Halstead. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, 1985.
STAR/MPI: Binding a Parallel Library to Interactive Symbolic.. - Cooperman (1995) (3 citations) (Correct)
....and can be distributed for free. Secondly, STAR MPI should demonstrate a methodology that can be transferred to additional interactive languages with relatively little development e ort. The latter requirement led to looking solely at asynchronous parallelism. In this class, Multilisp [10] is notable as an integration of an interactive language (LISP) on the BBN Butter y machine, but it does not transfer readily to other parallel architectures. It was decided to implement STAR MPI on top of an existing parallel language In order to satisfy the requirement of small development ....
R.H. Halstead, Jr., \Multilisp: A Language for Concurrent Symbolic Computation", ACM Transactions on Programming Languages and Systems 7(4), 1985, pp. 501-538.
Transactional Monitors for Concurrent Objects - Adam Welc Suresh (Correct)
No context found.
HALSTEAD, JR., R. H. Multilisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct. 1985), 501--538.
Safe Futures for Java - Welc, Jagannathan, Hosking (Correct)
No context found.
HALSTEAD, JR., R. H. Multilisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct. 1985), 501--538.
Enhancing Software Reliability With Speculative Threads - And The Committee (Correct)
No context found.
R. H. Halstead. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.
Architecture Study for Smart Cameras - Broers, Caarls, Jonker, Kleihorst (2005) (Correct)
No context found.
R. Halstead, Multilisp: A language for concurrent symbolic computation, in ACM Transactions on Programming Languages and Systems, October 1985.
Skeletons and Asynchronous RPC for Embedded Data- and.. - Caarls, Jonker.. (2005) (Correct)
No context found.
R. Halstead, jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, October 1985.
A Modal Language for the Safety of Mobile Values - Park (2005) (Correct)
No context found.
R. H. Halstead, Jr. Multilisp: a language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, 1985.
Mitsubishi Electric Research Laboratories - Cambridge Research Center (1993) (Correct)
No context found.
R. Halstead. Multilisp: A language for concurrent symbolic computation. ACM Trans. on Prog. Languages and Systems, pages 501--538, October 1985.
Generic Pickling and Minimization - Tack, Kornstaedt, Smolka (2005) (1 citation) (Correct)
No context found.
Halstead, R. H., Multilisp: a language for concurrent symbolic computation, ACM Transactions on Programming Languages and Systems (TOPLAS) 7 (1985), pp. 501--538. 22
This is a preprint of a copyrighted article that will.. - An Object-Oriented.. (1996) (Correct)
No context found.
R. Halstead, "MultiLisp: A Language for Concurrent Symbolic Computation." ACM Transactions on Programming Languages and Systems , Vol. 7, no. 4: 501-538, 1985.
Distributed Objects for Parallel Numerical Applications - Baude, Caromel, Sagnol (2002) (Correct)
No context found.
R. Halstead. Multilisp: A Language for Concurrent Symbolic Computation. ACM Transactions on Programming Languages and Systems, October 1985.
Partial Behavioral Reflection: Spatial and Temporal.. - Tanter, Noye.. (2003) (5 citations) (Correct)
No context found.
R. H. Halstead, Jr. Multilisp: a language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, 1985.
Extending the REpresentational State Transfer (REST).. - Khare, Taylor (2003) (Correct)
No context found.
Halstead, R. Multilisp :A Language for Concurrent Symbolic Computation in ACM Transactions on Programming Languages and Systems, 1985, 7 (4). pp. 501-538.
A High Performance Decomposition Solver for Portfolio.. - Laure, Moritsch (2001) (Correct)
No context found.
R. Halstead. Multilisp: A Language for Concurrent Symbolic Computation. ACM Transactions on Programming Languages and Systems, 7(4):501-538, 1985.
Mitsubishi Electric Research Laboratories - Cambridge Research Center (1993) (Correct)
No context found.
R. Halstead. Multilisp: A language for concurrent symbolic computation. ACM Trans. on Prog. Languages and Systems, pages 501--538, October 1985.
A Comparative Evaluation of - Parallel Garbage Collector (Correct)
No context found.
HALSTEAD, R. H. Multilisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct. 1985), 501--538.
Asynchronous and Deterministic Objects - Denis Caromel Ludovic (2004) (Correct)
No context found.
R. H. Halstead, Jr. Multilisp: a language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems (TOPLAS), 7(4):501--538, 1985.
The Gilgamesh Processor-in-Memory Architecture and Its.. - Hans Zima And (2001) (1 citation) (Correct)
No context found.
R.H.Halstead,Jr. Multilisp: A Language for Concurrent Symbolic Computation. ACM Transactions on Programming Languages and Systems (TOPLAS), 7(4),501-538, October 1985.
Optimistic Evaluation: An Adaptive Evaluation Strategy for.. - Ennals, Jones (2003) (1 citation) (Correct)
No context found.
R. H. Halstead. Multilisp - a language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501--538, Oct. 1985.
Workflow Enactment with Continuation and Future Objects - Manolescu (2002) (2 citations) (Correct)
No context found.
R. Halstead, Jr. MultiLISP: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7:501--538, October 1985.
Oaklisp: An Object-Oriented Dialect of Scheme - Lang, Pearlmutter (1988) (7 citations) (Correct)
No context found.
Halstead, R.H. "Multilisp: A language for concurrent symbolic computation . Transactions of Pro- gramming Languages and Systems 7. 4 (Oct. 1985), 501-538.
First 50 documents Next 50
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