Trees in algebra and programming, CAAP'94 : 19th International Colloquium, Edinburgh, U.K., April 1994 : proceedings /

Saved in:
Bibliographic Details
Meeting name:International Colloquium on Trees in Algebra and Programming (19th : 1994 : Edinburgh, Scotland)
Imprint:Berlin ; New York : Springer-Verlag, 1994.
Description:x, 351 p. : ill. ; 24 cm.
Series:Lecture notes in computer science 787
Subject:Trees (Graph theory) -- Data processing -- Congresses.
Data structures (Computer science) -- Congresses.
Computational complexity -- Congresses.
Computational complexity.
Data structures (Computer science)
Trees (Graph theory) -- Data processing.
Conference papers and proceedings.
Format: Print Book
URL for this record:
Hidden Bibliographic Details
Other authors / contributors:Tison, Sophie
ISBN:038757879X (U.S.)
Notes:Includes bibliographical references.
Table of Contents:
  • Ordering Constraints on Trees / H. Comon and R. Treinen
  • Graph Grammars and Tree Transducers / J. Engelfriet
  • Type Preorders / F. Alessi
  • Compilative Constructive Negation in Constraint Logic Programs / P. Bruscoli, F. Levi, G. Levi and M. C. Meo
  • A New Linear Algorithm for Modular Decomposition / A. Cournier and M. Habib
  • A CPS-Translation of the [lambda][mu]-Calculus / P. de Groote
  • A Lower Bound on the Growth of Functions Computed by Tree Transductions / F. Drewes
  • On the Decidability of Model Checking for Several [mu]-Calculi and Petri Nets / J. Esparza
  • Generalizations of the Periodicity Theorem of Fine and Wilf / R. Giancarlo and F. Mignosi
  • Probabilistic Domains / R. Heckmann
  • Some Results on Top-Context-Free Tree Languages / D. Hofbauer, M. Huber and G. Kucherov
  • On Higher Order Recursive Program Schemes / Z. Khasidashvili
  • Graphs and Decidable Transductions Based on Edge Constraints / N. Klarlund and M. I. Schwartzbach
  • Non-Deterministic Automata with Concurrency Relations and Domains / D. Kuske
  • Algebraic and Combinatorial Properties of Simple, Coloured Walks / D. Merlini, R. Sprugnoli and M. C. Verri
  • Probabilistic Analysis of an Election Algorithm in a Tree / Y. Metivier and N. Saheb
  • On the First-Order Equivalence of Call-by-Name and Call-by-Value / T. Noll
  • On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems / E. Ohlebush
  • Global Program Analysis in Constraint Form / J. Palsberg
  • On Projective and Separable Properties / D. Peled
  • A Rank Hierarchy for Deterministic Tree-Walking Transducers / O. Rambow and G. Satta
  • Superposition in Picture Languages / B. Ratoandromanana and D. Robilliard
  • A Grammar-Based Data-Flow Analysis to Stop Deforestation / M. H. Sorensen.