PARLE Parallel Architectures and Languages Europe: Vol. 2: Parallel Languages, Eindhoven, The Netherlands, June 15-19, 1987; Proceedings: Lecture Notes in Computer Science, cartea 259

Executing a program on the MIT Tagged-Token Dataflow architecture.- PARLOG: The language and its applications.- Functional programming and communicating processes.- Garbage collection in a distributed environment.- Decidability of bisimulation equivalence for processes generating context-free languages.- An approach to programming process interconnection structures: Aggregate rewriting graph grammars.- Specifying functional and timing behavior for real-time applications.- Term graph rewriting.- Towards an intermediate language based on Graph Rewriting.- Distributed garbage collection using reference counting.- Rigorous development of a distributed calendar system.- A reduction semantics for imperative higher-order languages.- Petri net models for algebraic theories of concurrency.- A computational model for distributed systems using operator nets.- Design and proof of communicating sequential processes.- Parallel programming in Temporal Logic.- "Ruth: A functional language for real-time programming".- A compositional proof theory for real-time distributed message passing.- STREAM: A scheme language for formally describing digital circuits.- A fully abstract semantics for data flow nets.- The concurrent assignment representation of synchronous systems.- A new and efficient implementation of multiprocess synchronization.- Rewriting techniques for the temporal analysis of communicating processes.- Optimistic and-parallelism in Prolog.- An efficient garbage collection scheme for parallel computer architectures.- Task sequencing language for specifying distributed Ada systems TSL-1.