000 03962nam a22005535i 4500
001 978-3-540-48373-1
003 DE-He213
005 20160624102033.0
007 cr nn 008mamaa
008 121227s1994 gw | s |||| 0|eng d
020 _a9783540483731
_9978-3-540-48373-1
024 7 _a10.1007/BFb0017469
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aTrees in Algebra and Programming — CAAP'94
_h[electronic resource] :
_b19th International Colloquium Edinburgh, U.K., April 11–13, 1994 Proceedings /
_cedited by Sophie Tison.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1994.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1994.
300 _aXI, 361 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 ;
_v787
505 0 _aOrdering constraints on trees -- Graph grammars and tree transducers -- Type Preorders -- Compilative constructive negation in constraint logic programs -- A new linear algorithm for Modular Decomposition -- A CPS-translation of the ??-calculus -- A lower bound on the growth of functions computed by tree transductions -- On the decidability of model checking for several ?-calculi and Petri nets -- Generalizations of the periodicity theorem of Fine and Wilf -- Probabilistic domains -- Some results on top-context-free tree languages -- On higher order recursive program schemes -- Graphs and decidable transductions based on edge constraints -- Nondeterministic automata with concurrency relations and domains -- Algebraic and combinatorial properties of simple, coloured walks -- Probabilistic analysis of an election algorithm in a tree -- On the first-order equivalence of call-by-name and call-by-value -- On the modularity of confluence of constructor-sharing term rewriting systems -- Global program analysis in constraint form -- On projective and separable properties -- A rank hierarchy for deterministic tree-walking transducers -- Superposition in picture languages -- A grammar-based data-flow analysis to stop deforestation.
520 _aThis volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aLogic design.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aProgramming Techniques.
650 2 4 _aData Structures.
650 2 4 _aCombinatorics.
700 1 _aTison, Sophie.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540578796
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v787
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0017469
942 _2EBK6441
_cEBK
999 _c35735
_d35735