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

Paul Franchi-Zannettacci

ISBN 10: 354016443X / ISBN 13: 9783540164432

Editore: Springer Berlin Heidelberg, 1986

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - 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.

Codice articolo 9783540164432

Dati bibliografici

• Titolo: CAAP'86 : 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986. Proceedings
• Editore: Springer Berlin Heidelberg
• Data di pubblicazione: 1986
• Lingua: Inglese
• ISBN 10: 354016443X
• ISBN 13: 9783540164432
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 16 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 16 millimetri di profondità
• Peso: 429 grammi

Descrizione articolo

Contenuti

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.