CAAP'86
11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986. Proceedings
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
80.24 €
40 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „CAAP'86 “
Klappentext zu „CAAP'86 “
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.
Inhaltsverzeichnis zu „CAAP'86 “
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.
Bibliographische Angaben
- 1986, 1986, 308 Seiten, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Ed. by Paul Franchi-Zannettacci
- Herausgegeben: Paul Franchi-Zannettacci
- Verlag: Springer
- ISBN-10: 354016443X
- ISBN-13: 9783540164432
- Erscheinungsdatum: 01.03.1986
Sprache:
Englisch
Kommentar zu "CAAP'86"
0 Gebrauchte Artikel zu „CAAP'86“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "CAAP'86".
Kommentar verfassen