Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1059)
Included in the following conference series:
Conference proceedings info: CAAP 1996.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (23 papers)
Other volumes
-
Trees in Algebra and Programming — CAAP '96
Bibliographic Information
Book Title: Trees in Algebra and Programming - CAAP '96
Book Subtitle: 21st International Colloquium, Linköping, Sweden, April 22-24, 1996. Proceedings
Editors: Hélène Kirchner
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-61064-2
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1996
Softcover ISBN: 978-3-540-61064-9Published: 03 April 1996
eBook ISBN: 978-3-540-49944-2Published: 07 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 336
Topics: Theory of Computation, Programming Languages, Compilers, Interpreters, Computation by Abstract Devices, Logics and Meanings of Programs, Programming Techniques, Algorithm Analysis and Problem Complexity