CAAP'86 : 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986. Proceedings

Paul Franchini-Zannettacci

ISBN 10: 354016443X / ISBN 13: 9783540164432

Published by Springer, Berlin, Springer, 1986

About this Item

Neuware - A categorical treatment of pre- and post- conditions.- Colourings of planar maps and the equality of two languages.- On the equivalence of synchronization sets.- Inner and mutual compatibility of basic operations on module specifications.- Exact computation sequences.- An algebraic theory of flowchart schemes.- An algebraic formalism for graphs.- Membership for growing context sensitive grammars is polynomial.- Weighted graphs : A tool for logic programming.- Classical and incremental evaluators for attribute grammars.- Transformation strategies for deriving on line programs.- Probabilistic Ianov's schemes.- Alternating bottom-up tree recognizers.- Bottom-up recursion in trees.- Basic tree transducers.- Trie partitioning process: Limiting distributions.- Random walks, gaussian processes and list structures.- Random walks on trees.- Infinite trees, markings and well foundedness.- Computable directory queries.- Relating type-structures partial variations on a theme of Friedman and Statman.- On applications of algorithmic logic.

Seller Inventory # 9783540164432

Bibliographic Details

• Title: CAAP'86 : 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986. Proceedings
• Publisher: Springer, Berlin, Springer
• Publication Date: 1986
• Language: English
• ISBN 10: 354016443X
• ISBN 13: 9783540164432
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 188H x 35D millimeters 235 millimeters width by 188 millimeters height by 35 millimeters depth
• Weight: 510 grams

About this title

Synopsis

A categorical treatment of pre- and post- conditions.- Colourings of planar maps and the equality of two languages.- On the equivalence of synchronization sets.- Inner and mutual compatibility of basic operations on module specifications.- Exact computation sequences.- An algebraic theory of flowchart schemes.- An algebraic formalism for graphs.- Membership for growing context sensitive grammars is polynomial.- Weighted graphs : A tool for logic programming.- Classical and incremental evaluators for attribute grammars.- Transformation strategies for deriving on line programs.- Probabilistic Ianov's schemes.- Alternating bottom-up tree recognizers.- Bottom-up recursion in trees.- Basic tree transducers.- Trie partitioning Limiting distributions.- Random walks, gaussian processes and list structures.- Random walks on trees.- Infinite trees, markings and well foundedness.- Computable directory queries.- Relating type-structures partial variations on a theme of Friedman and Statman.- On applications of algorithmic logic.