Trees in algebra and programming - CAAP '96

Trees in algebra and programming - CAAP '96

by Colloquium on Trees in Algebraand Programming (21st 1996 Linköping

Book 1059 of Lecture notes in computer science --

1996
Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
"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."--PUBLISHER'S WEBSITE.

Discuss Trees in algebra and programming - CAAP '96 with other readers

Join or start a book club for Trees in algebra and programming - CAAP '96 on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Trees in algebra and programming - CAAP '96?

Sign up free on Readfeed, then browse public clubs or start your own club with Trees in algebra and programming - CAAP '96 as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Trees in algebra and programming - CAAP '96 with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Trees in algebra and programming - CAAP '96 with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.