000 03799nam a22004575i 4500
001 978-3-540-38930-9
003 DE-He213
005 20160624101942.0
007 cr nn 008mamaa
008 121227s1988 gw | s |||| 0|eng d
020 _a9783540389309
_9978-3-540-38930-9
024 7 _a10.1007/BFb0026091
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aCAAP '88
_h[electronic resource] :
_b13th Colloquium on Trees in Algebra and Programming Nancy, France, March 21–24, 1988 Proceedings /
_cedited by M. Dauchet, M. Nivat.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1988.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1988.
300 _aVIII, 305 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 ;
_v299
505 0 _aA tree pattern matching algorithm with reasonable space requirements -- On the maximum path length of AVL trees -- Decomposition trees: Structured graph representation and efficient algorithms -- On counting and approximation -- Parameter-reduction of higher level grammars -- Analysis of dynamic algorithms in D.E.Knuth's model -- On completeness of narrowing strategies -- Implementing term rewrite languages in Dactl -- Unification in primal algebras -- Algebraic specification with built-in domain constructions -- Product and iteration of module specifications -- Equational completion in order-sorted algebras extended abstract -- Proving systolic arrays -- Expressiveness bounds for completeness in trace-based network proof systems -- Proof systems for Hennessy-Milner Logic with recursion -- Regular automata and model checking -- Interval logics and sequential transducers -- A2CCS: A simple extension of CCS for handling atomic actions -- Modelling statecharts behaviour in a fully abstract way -- Directed hypergraphs: Data structures and applications.
520 _aThis volume contains the proceedings of the 13th Colloquium on Trees in Algebra and Programming (CAAP '88), held in Nancy, March 21-24, 1988. The preceding 12 colloquia were held in France, Italy and Germany. CAAP '85 and CAAP '87 were integrated into the International Joint Conference on Theory and Practice of Software Development, TAPSOFT (see Lecture Notes in Computer Science volumes 185 and 249). As another effort to link theory and practice in computer science, CAAP '88 was held in conjunction with the European Symposium on Programming, ESOP '88 (see volume 300 of this Lecture Notes series). CAAP '88 is a conference in the area of program development and programming concepts but, following the tradition, is devoted to theoretical aspects, and especially to Trees, a basic structure of computer science. A wider range of topics in theoretical computer science is also covered. The papers are on word, tree or graph languages, with algorithmic or complexity studies, on abstract data types (another classical topic of CAAP) and/or term rewriting systems and on non-standard logics, and parallelism and concurrency.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
700 1 _aDauchet, M.
_eeditor.
700 1 _aNivat, M.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540190219
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v299
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0026091
942 _2EBK4568
_cEBK
999 _c33862
_d33862