000 03471nam a22005055i 4500
001 978-3-540-47181-3
003 DE-He213
005 20160624102020.0
007 cr nn 008mamaa
008 121227s1987 gw | s |||| 0|eng d
020 _a9783540471813
_9978-3-540-47181-3
024 7 _a10.1007/3-540-17945-3
_2doi
050 4 _aQA76.7-76.73
050 4 _aQA76.76.C65
072 7 _aUMX
_2bicssc
072 7 _aUMC
_2bicssc
072 7 _aCOM051010
_2bisacsh
072 7 _aCOM010000
_2bisacsh
082 0 4 _a005.13
_223
245 1 0 _aPARLE Parallel Architectures and Languages Europe
_h[electronic resource] :
_bVolume II: Parallel Languages Eindhoven, The Netherlands, June 15–19, 1987 Proceedings /
_cedited by J. W. Bakker, A. J. Nijman, P. C. Treleaven.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1987.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1987.
300 _aXVI, 468 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v259
505 0 _aExecuting 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.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aProcessor Architectures.
700 1 _aBakker, J. W.
_eeditor.
700 1 _aNijman, A. J.
_eeditor.
700 1 _aTreleaven, P. C.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540179450
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v259
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-17945-3
942 _2EBK5997
_cEBK
999 _c35291
_d35291