Ebook: Trees in Algebra and Programming — CAAP '96: 21st International Colloquium Linköping, Sweden, April 22–24, 1996 Proceedings
- Genre: Mathematics // Algebra
- Tags: Computation by Abstract Devices, Logics and Meanings of Programs, Programming Techniques, Algorithm Analysis and Problem Complexity, Mathematical Logic and Formal Languages, Discrete Mathematics in Computer Science
- Series: Lecture Notes in Computer Science 1059
- Year: 1996
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- djvu
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.
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.
Download the book Trees in Algebra and Programming — CAAP '96: 21st International Colloquium Linköping, Sweden, April 22–24, 1996 Proceedings for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)