CAAP '81: Trees in Algebra and Programming 6th Colloquium Genoa, March 5–7, 1981 Proceedings

Algebraic theory of parameterized specifications with requirements....Pages 1-24
A modal characterisation of observable machine-behaviour....Pages 25-34
Trees as data and file structures....Pages 35-45
Infinitary relations....Pages 46-75
Full approximability of a class of problems over power sets....Pages 76-87
How to compute generators for the intersection of subgroups in free groups....Pages 88-100
 Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG....Pages 101-116
Top-down tree-transducers for infinite trees I....Pages 117-134
Easy solutions are hard to find....Pages 135-146
Une semantique pour les arbres non deterministes....Pages 147-161
On the algebraic specification of nondeterministic programming languages....Pages 162-179
Applied tree enumerations....Pages 180-193
Evaluation d\'arbre pour un calcul formel (application a l\'enumeration de proteines)....Pages 194-210
On pushdown tree automata....Pages 211-223
Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities....Pages 224-237
Calcul du rang des ∑-arbres infinis regulers....Pages 238-254
A class of tree-like UNION-FIND data structures and the nonlinearity....Pages 255-267
Grammars without erasing rules. the OI case....Pages 268-279
Proprietes de cloture d\'une extension de transducteurs d\'arbres deterministes....Pages 280-289
Certain algorithms for subgraph isomorphism problems....Pages 290-307
A # P-complete problem over arithmetical trees....Pages 308-315
Trees in Kripke models and in an intuitionistic refutation system....Pages 316-331
Efficient optimization of monotonic functions on trees....Pages 332-339
Differents types de derivations infinies dans les grammaires algebriques d\'arbres....Pages 340-349
Discriminability of infinite sets of terms in the D ∞ -models of the λ-calculus....Pages 350-364