LEADER 05056nam 22007215 450 001 996465650003316 005 20200630053213.0 010 $a3-540-46799-8 024 7 $a10.1007/3-540-55251-0 035 $a(CKB)1000000000233788 035 $a(SSID)ssj0000321719 035 $a(PQKBManifestationID)11937834 035 $a(PQKBTitleCode)TC0000321719 035 $a(PQKBWorkID)10280051 035 $a(PQKB)10868125 035 $a(DE-He213)978-3-540-46799-1 035 $a(PPN)155167979 035 $a(EXLCZ)991000000000233788 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCAAP '92$b[electronic resource] $e17th Colloquium on Trees in Algebra and Programming Rennes, France, February 26-28, 1992. Proceedings /$fedited by Jean-Claude Raoult 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (IX, 491 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v581 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-55251-0 327 $aA constructive valuation interpretation for classical logic and its use in witness extraction -- Varieties of increasing trees -- Origin functions in ?-calculus and term rewriting systems -- An algebraic approach to the interpretation of recursive types -- Decidability of reachability and disjoint union of term rewriting systems -- A complete type inference algorithm for simple intersection types -- Monadic second-order definable graph transductions -- CTL* and ECTL* as fragments of the modal ?-calculus -- Power domains supporting recursion and failure -- Parallel contraction of fibonacci trees and prefix computations on a family of interconnection topologies -- Must preorder in non-deterministic untyped ?-calculus -- A programming language for deriving hypergraphs -- Graph grammars as context-dependent rewriting systems: A partial ordering semantics -- Empty stack Pushdown ?-tree automata -- Modulo counting quantifiers over finite trees -- Finite tree automata with cost functions -- Partial type assignment in left linear applicative term rewriting systems -- A linear algorithm for solving fixed-point equations on transition systems -- Beyond conditional equations. 330 $aThis volume contains selected papers presented at the seventeenth Colloquiumon Trees in Algebra and Programming (CAAP) held jointly with the European Symposium on Programming (ESOP) in Rennes, France, February 26-28, 1992 (the proceedings of ESOP appear in LNCS 582). The previous colloquia were held in France, Italy, Germany, Spain, Denmark and England. Every even year, as in 1992, CAAP is held jointly with ESOP; every other year, it is part of TAPSOFT (Theory And Practice of SOFTware development). In the beginning, CAAP was devoted to algebraic and combinatorial properties of trees and their role in various fields of computer science. The scope of CAAP has now been extended to other discrete structures, like graphs, equations and transformations of graphs, and their links with logical theories. The programme committee received 40 submissions, from which 19 papers have been selected for inclusion inthis volume. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v581 606 $aComputer programming 606 $aSoftware engineering 606 $aComputers 606 $aAlgorithms 606 $aComputer logic 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 615 0$aComputer programming. 615 0$aSoftware engineering. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer logic. 615 14$aProgramming Techniques. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aTheory of Computation. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 676 $a511/.5 702 $aRaoult$b Jean-Claude$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aColloquium on Trees in Algebra and Programming 906 $aBOOK 912 $a996465650003316 996 $aCAAP '92$92830285 997 $aUNISA