Franchi-Zannettacci

CAAP'86

11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986. Proceedings
Mitarbeit:Franchini-Zannettacci, Paul

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Lecture Notes in Computer Science 214
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-16443-2
• 1986.
• Seitenzahl: 280
• Erscheinungstermin: 1. März 1986
• Englisch
• Abmessung: 235mm x 155mm x 16mm
• Gewicht: 510g
• ISBN-13: 9783540164432
• ISBN-10: 354016443X
• Artikelnr.: 09231717

Inhaltsangabe

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.