Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1994

Trees in Algebra and Programming - CAAP '94

19th International Colloquium, Edinburgh, U.K., April 11 - 13, 1994. Proceedings

Editors:

  1. Sophie Tison
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 787)

Conference series link(s): CAAP: Colloquium on Trees in Algebra and Programming

Conference proceedings info: CAAP 1994.

Sections

Buy it now

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (23 papers)

  1. Front Matter

    PDF

  2. Ordering constraints on trees

    • Hubert Comon, Ralf Treinen
    Pages 1-14

  3. Graph grammars and tree transducers

    • Joost Engelfriet
    Pages 15-36

  4. Type Preorders

    • Fabio Alessi
    Pages 37-51

  5. Compilative constructive negation in constraint logic programs

    • Paola Bruscoli, Francesca Levi, Giorgio Levi, Maria Chiara Meo
    Pages 52-67

  6. A new linear algorithm for Modular Decomposition

    • Alain Cournier, Michel Habib
    Pages 68-84

  7. A CPS-translation of the λμ-calculus

    • Philippe de Groote
    Pages 85-99

  10. Generalizations of the periodicity theorem of Fine and Wilf

    • R. Giancarlo, F. Mignosi
    Pages 130-141

  11. Probabilistic domains

    • Reinhold Heckmann
    Pages 142-156

  12. Some results on top-context-free tree languages

    • Dieter Hofbauer, Maria Huber, Gregory Kucherov
    Pages 157-171

  13. On higher order recursive program schemes

    • Zurab Khasidashvili
    Pages 172-186

  14. Graphs and decidable transductions based on edge constraints

    • Nils Klarlund, Michael I. Schwartzbach
    Pages 187-201

  16. Algebraic and combinatorial properties of simple, coloured walks

    • Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri
    Pages 218-233

  17. Probabilistic analysis of an election algorithm in a tree

    • Yves Métivier, Nasser Saheb
    Pages 234-245

  20. Global program analysis in constraint form

    • Jens Palsberg
    Pages 276-290
Back to top

Other Volumes

  1. Trees in Algebra and Programming — CAAP'94

Back to top

About this book

This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers.
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation