Table of contents

  1. Front Matter
  2. Samson Abramsky
    Pages 1-1
  3. Anne Bottreau, Yves Métivier
    Pages 2-16
  4. Marina Madonia, Stefano Varricchio
    Pages 17-29
  5. Alexandre Boudet, Hubert Comon
    Pages 30-43
  6. Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri
    Pages 59-71
  7. Frank Pfenning
    Pages 119-134
  8. Leo Bachmair, Ta Chen, C. R. Ramakrishnan, I. V. Ramakrishnan
    Pages 135-148
  9. Maribel Fernández, Ian Mackie
    Pages 149-164
  10. John Glauert, Zurab Khasidashvili
    Pages 180-195
  11. Michel Bidoit, Andrzej Tarlecki
    Pages 241-256
  12. Allan Cheng, Mogens Nielsen
    Pages 257-271

About these proceedings

Introduction

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

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-61064-2
  • Copyright Information Springer-Verlag 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-61064-9
  • Online ISBN 978-3-540-49944-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book