CAAP '81 : Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings. 1st ed. 1981

種類:

電子ブック

責任表示:

edited by E. Astesiano, C. Böhm

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1981

著者名:

• Astesiano, E.
• Böhm, C.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 112

ISBN:

9783540387169 [3540387161]    

注記:

Algebraic theory of parameterized specifications with requirements -- A modal characterisation of observable machine-behaviour -- Trees as data and file structures -- Infinitary relations -- Full approximability of a class of problems over power sets -- How to compute generators for the intersection of subgroups in free groups -- Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG -- Top-down tree-transducers for infinite trees I -- Easy solutions are hard to find -- Une semantique pour les arbres non deterministes -- On the algebraic specification of nondeterministic programming languages -- Applied tree enumerations -- Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines) -- On pushdown tree automata -- Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities -- Calcul du rang des ?-arbres infinis regulers -- A class of tree-like UNION-FIND data structures and th

ローカル注記:

学内専用E-BOOKS (local access only)