Trees in algebra and programming--CAAP '96 : 21st international colloquium, Linköping, Sweden, April 22-24, 1996, proceedings /

Saved in:
Bibliographic Details
Meeting name:CAAP '96 (21st : 1996 : Linköping, Sweden)
Imprint:Berlin ; New York : Springer, 1996.
Description:1 online resource (viii, 329 pages) : illustrations.
Series:Lecture notes in computer science ; 1059
Lecture notes in computer science ; 1059.
Subject:Trees (Graph theory) -- Data processing -- Congresses.
Data structures (Computer science) -- Congresses.
Computational complexity -- Congresses.
Computational complexity.
Data structures (Computer science)
Trees (Graph theory) -- Data processing.
Electronic books.
Conference papers and proceedings.
Format: E-Resource Book
URL for this record:
Hidden Bibliographic Details
Other authors / contributors:Kirchner, H. (Hélène)
Notes:Includes bibliographical references and index.
Summary:This book constitutes the refereed proceedings of the 21st International Colloquium on Trees in Algebra and Programming, CAAP '96, held in Linkping, 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.