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

Eric G. Wagner (auth.), Paul Franchi-Zannettacci (eds.)9783540164432, 354016443X

Table of contents :
A categorical treatment of pre- and post- conditions….Pages 1-5
Colourings of planar maps and the equality of two languages….Pages 6-16
On the equivalence of synchronization sets….Pages 17-29
Inner and mutual compatibility of basic operations on module specifications….Pages 30-44
Exact computation sequences….Pages 45-59
An algebraic theory of flowchart schemes….Pages 60-73
An algebraic formalism for graphs….Pages 74-84
Membership for growing context sensitive grammars is polynomial….Pages 85-99
Weighted graphs : A tool for logic programming….Pages 100-111
Classical and incremental evaluators for attribute grammars….Pages 112-126
Transformation strategies for deriving on line programs….Pages 127-141
Probabilistic Ianov’s schemes….Pages 142-157
Alternating bottom-up tree recognizers….Pages 158-171
Bottom-up recursion in trees….Pages 172-182
Basic tree transducers….Pages 183-195
Trie partitioning process: Limiting distributions….Pages 196-210
Random walks, gaussian processes and list structures….Pages 211-224
Random walks on trees….Pages 225-237
Infinite trees, markings and well foundedness….Pages 238-253
Computable directory queries….Pages 254-265
Relating type-structures partial variations on a theme of Friedman and Statman….Pages 266-287
On applications of algorithmic logic….Pages 288-306