default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. PARLE 1989: Eindhoven, The Netherlands - Volume 2
- Eddy Odijk, Martin Rem, Jean-Claude Syre:
PARLE '89: Parallel Architectures and Languages Europe, Volume II: Parallel Languages, Eindhoven, The Netherlands, June 12-16, 1989, Proceedings. Lecture Notes in Computer Science 366, Springer 1989, ISBN 3-540-51285-3
Invited Lectures
- Gul Agha:
Supporting Multiparadigm Programming on Actor Architectures. 1-19 - David Gelernter:
Multiple Tuple Spaces in Linda. 20-27 - Anthony J. G. Hey
:
Experiments in MIMD Parallelism. 28-42
Submitted Presentations
- Jesús Labarta, Eduard Ayguadé:
GTS: Extracting Full Parallelism Out of DO Loops. 43-54 - Richard Banach:
Dataflow Analysis if Term Graph Rewriting Systems. 55-72 - Ryszard Janicki, Maciej Koutny:
Towards A Theory Of Simulation For Verification Of Concurrent Systems. 73-88 - Antti Valmari:
Eliminating Redundant Interleavings During Concurrent Program Verification. 89-103 - Susumu Yamasaki:
Dataflow Programs for Parallel Computations of Logic Programs and their Semantics. 104-114 - Bernd Schwinn, Gerhard Barth, Christoph Welsch:
RAPiD A Data Flow Model for Implementing Parallelism and Intelligent Backtracking in Logic Programs. 115-132 - Bogumil Hausman:
Pruning and Scheduling Speculative Work in Or-Parallel Prolog. 133-150 - Jacques Chassin de Kergommeaux, Uri Baron, Wolfgang Rapp, Michael Ratcliffe:
Performance Analysis of a Parallel Prolog: A Correlated Approach. 151-164 - Steven K. Goering, Simon M. Kaplan:
Visual Concurrent Object-Based Programming in GARP. 165-180 - Apostolos Nikolaos Refenes, Eugene Eberbach, Stephen C. McCabe, Philip C. Treleaven:
PARLE: A Parallel Target Language for Integrating Symbolic and Numeric Processing. 181-198 - Ralph-Johan Back:
A Method for Refining Atomicity in Parallel Algorithms. 199-216 - Bengt Jonsson, Joost N. Kok:
Comparing Two Fully Abstract Dataflow Models. 217-234 - José del R. Millán, Pau Bofill:
Learning by Back-Propagation: Computing in a Systolic Way. 235-252 - Christian Lengauer:
Towards Systolizing Compilation: An Overview. 253-272 - Fabrizio Baiardi, Salvatore Orlando:
Strategies for a Massively Parallel Implementation of Simulated Annealing. 273-287 - Gaétan Hains:
The Compaction of Acyclic Terms. 288-303 - Paraskevas Evripidou, Walid A. Najjar, Jean-Luc Gaudiot:
A Single-Assignment Language in a Distributed Memory Multiprocessor. 304-320 - Björn Lisper:
Single-Assignment Semantics for Imperative Programs. 321-334 - Zhiyi Hwang, Shouren Hu:
A Compliling Approach for Exploiting And-parallelism in Parallel Logic Programming Systems. 335-345 - Giuseppe Marino, Giancarlo Succi:
Data structures for parallel execution of functional languages. 346-356 - Flemming Nielson:
The Typed lambda-Calculus with First-Class Processes. 357-373 - Brian Livezey, Richard R. Muntz:
ASPEN: A Stream Processing Environment. 374-388 - Joachim Parrow:
The Expressive Power of Simple Parallelism. 389-405 - Frank S. de Boer:
Compositionality in the Temporal Logic of Concurrent Systems (extended abstract). 406-423 - Jozef Hooman, Jennifer Widom:
A Temporal-Logic Based Compositional Proof System for Real-Time Message Passing. 424-441
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
