CAAP '88: 13th Colloquium on Trees in Algebra and Programming Nancy, France, March 21-24, 1988. Proceedings
Max Dauchet, Maurice Nivat
Springer Science & Business Media, Mar 9, 1988 - Computers - 303 pages
This volume contains the proceedings of the 13th Colloquium on Trees in Algebra and Programming (CAAP '88), held in Nancy, March 21-24, 1988. The preceding 12 colloquia were held in France, Italy and Germany. CAAP '85 and CAAP '87 were integrated into the International Joint Conference on Theory and Practice of Software Development, TAPSOFT (see Lecture Notes in Computer Science volumes 185 and 249). As another effort to link theory and practice in computer science, CAAP '88 was held in conjunction with the European Symposium on Programming, ESOP '88 (see volume 300 of this Lecture Notes series). CAAP '88 is a conference in the area of program development and programming concepts but, following the tradition, is devoted to theoretical aspects, and especially to Trees, a basic structure of computer science. A wider range of topics in theoretical computer science is also covered. The papers are on word, tree or graph languages, with algorithmic or complexity studies, on abstract data types (another classical topic of CAAP) and/or term rewriting systems and on non-standard logics, and parallelism and concurrency.
What people are saying - Write a review
We haven't found any reviews in the usual places.
abstract algebraic specifications algorithm apply AVL trees Boolean complete complete lattice components composition Computer Science condition consider construction constructor correctness assertions corresponding critical pair Dactl data types decomposition tree defined Definition denote derivation equations equivalent example expressed Fibonacci trees finite first-order trace logic formula f function symbol given grammar graph hierarchical hyperedge hypergraph infinite input internal path length interval logic interval term language Lemma LNCS matching micro-steps module specifications morphism node nondeterministic nondeterministic Turing machine occur operational semantics order-sorted output pair parameters pattern polynomial primal algebras primitive sorts priority queues problem Proc proof system properties recursive reduces restricted rule satisfying SCSP semantics sequence sfth transition solution sort-decreasing span-P Statecharts subject tree subset subterm syntactical systolic arrays temporal logic temporal operators term rewriting system terminal Theorem transition labeled Turing machine unification valid variable