Skip to main content
  • Conference proceedings
  • © 1996

Trees in Algebra and Programming - CAAP '96

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

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

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

Conference proceedings info: CAAP 1996.

Buying options

eBook USD 74.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-49944-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 99.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (23 papers)

  1. Front Matter

  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. The area determined by underdiagonal lattice paths

    • Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri
    Pages 59-71
  7. The practice of logical frameworks

    • Frank Pfenning
    Pages 119-134
  8. Subsumption algorithms based on search trees

    • Leo Bachmair, Ta Chen, C. R. Ramakrishnan, I. V. Ramakrishnan
    Pages 135-148
  9. Interaction nets and term rewriting systems (extended abstract)

    • Maribel Fernández, Ian Mackie
    Pages 149-164
  10. Relative normalization in Deterministic Residual Structures

    • John Glauert, Zurab Khasidashvili
    Pages 180-195
  11. Behavioural satisfaction and equivalence in concrete model categories

    • Michel Bidoit, Andrzej Tarlecki
    Pages 241-256
  12. Open maps, behavioural equivalences, and congruences

    • Allan Cheng, Mogens Nielsen
    Pages 257-271

Other Volumes

  1. Trees in Algebra and Programming — CAAP '96

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

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.

Keywords

  • Automata Theory
  • Automatentheorie
  • Combinatorics
  • Discrete Mathematics
  • Formal Verification
  • Formale Verifikation
  • Kombinatorik
  • Programmiersprachen
  • Programming Languages
  • computer
  • computer science
  • programming
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

eBook USD 74.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-49944-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 99.00
Price excludes VAT (USA)