Skip to main content
SpringerLink
Log in

Trees in Algebra and Programming - CAAP '96

21st International Colloquium, Linköping, Sweden, April 22-24, 1996. Proceedings

  • Conference proceedings
  • © 1996

Overview

Editors:
  1. Hélène Kirchner
    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 1059)

Included in the following conference series:

Conference proceedings info: CAAP 1996.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 papers)

  1. Front Matter

    Download chapter PDF

  2. Semantics of interaction

    • Samson Abramsky
    Pages 1-1

  3. The Kronecker product and local computations in graphs

    • Anne Bottreau, Yves Métivier
    Pages 2-16

  4. Iterative pairs and multitape automata

    • Marina Madonia, Stefano Varricchio
    Pages 17-29

  5. Diophantine equations, Presburger arithmetic and finite automata

    • Alexandre Boudet, Hubert Comon
    Pages 30-43

  6. A pumping lemma for output languages of macro tree transducers

    • Armin Kühnemann
    Pages 44-58

  7. The area determined by underdiagonal lattice paths

    • Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri
    Pages 59-71

  8. Extraction of concurrent processes from higher dimensional automata

    • Yukihide Takayama
    Pages 72-86

  9. Axiomatising extended computation tree logic

    • Roope Kaivola
    Pages 87-101

  10. Final semantics for a higher order concurrent language

    • Marina Lenisa
    Pages 102-118

  11. The practice of logical frameworks

    • Frank Pfenning
    Pages 119-134

  12. Subsumption algorithms based on search trees

    • Leo Bachmair, Ta Chen, C. R. Ramakrishnan, I. V. Ramakrishnan
    Pages 135-148

  13. Interaction nets and term rewriting systems (extended abstract)

    • Maribel Fernández, Ian Mackie
    Pages 149-164

  14. Computing in unpredictable environments: Semantics, reduction strategies, and program transformations

    • Björn Lisper
    Pages 165-179

  15. Relative normalization in Deterministic Residual Structures

    • John Glauert, Zurab Khasidashvili
    Pages 180-195

  16. Termination by absence of infinite chains of dependency pairs

    • Thomas Arts
    Pages 196-210

  17. Confluence without termination via parallel critical pairs

    • Bernhard Gramlich
    Pages 211-225

  18. An ordinal calculus for proving termination in term rewriting

    • E. A. Cichon, H. Touzet
    Pages 226-240

  19. Behavioural satisfaction and equivalence in concrete model categories

    • Michel Bidoit, Andrzej Tarlecki
    Pages 241-256

  20. Open maps, behavioural equivalences, and congruences

    • Allan Cheng, Mogens Nielsen
    Pages 257-271
Back to top

Other volumes

  1. Trees in Algebra and Programming — CAAP '96

Keywords

About this book

This book constitutes the refereed proceedings of the 21st International Colloquium on Trees in Algebra and Programming, CAAP '96, held in Linköping, Sweden, in April 1996.
The 21 full revised papers presented were selected from 44 submissions; also included are invited papers by Samson Abramsky and Frank Pfenning. In keeping with the tradition of the CAAP conferences, this volume covers algebraic, logical, and combinatorial properties of discrete structures and their application to computer science, in particular to the theory of computation and to programming theory.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation