Blick ins Buch

CAAP '90

15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings

Andre Arnold (Herausgeber)

Buch | Softcover

VI, 288 Seiten

1990 | 1990
Springer Berlin (Verlag)
978-3-540-52590-5 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

This volume contains the proceedings of the Fifteenth Colloquium on Trees in Algebra and Programming. The papers selected present new research results and cover the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered as that of sets of discrete structures and the theory of rewriting systems over these objects. - Application of discrete structures in computer science, including syntax and semantics of programming languages, operational semantics, logic programming, algorithms and data structures, complexity of algorithms and implementation aspects, proof techniques for nonnumerical algorithms, formal specifications, and visualization of trees and graphs.

On the power of bounded concurrency II: The pushdown automata level.- Trees everywhere.- Combinatory forms for equational programming: Instances, unification and narrowing.- Graphical versus logical specifications.- More efficient bottom-up tree pattern matching.- On the regular structure of prefix rewriting.- A unified approach for showing language containment and equivalence between various types of ?-automata.- Unitary monoid with two generators: An algorithmic point of view.- Coherence of subsumption.- Petri nets as models of linear logic.- Towards the unification of models for concurrency.- A markovian concurrency measure.- Graph matching in operational semantics and typing.- ML typability is dexptime-complete.- Testing for inductiue (co)-reducibility.- Probabilistic analysis of some distributed algorithms.- Infinite values in hierarchical imperative types.- Equivalence of finite-valued bottom-up finite state tree transducers is decidable.

Erscheint lt. Verlag	25.4.1990
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	VI, 288 p.
Verlagsort	Berlin
Sprache	englisch
Maße	160 x 240 mm
Gewicht	537 g
Themenwelt	Mathematik / Informatik ► Informatik
Themenwelt	Mathematik / Informatik ► Mathematik ► Algebra
Schlagworte	Algebra • algorithm • Algorithmen • algorithms • Algorithmus • Complexity • data structure • data structures • Formale Sprache • formal language • formal specification • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Logic • Programmieren • Programmiersprache • Programmierung • programming • Programming language • Semantics • Sets • Software Engineering / Softwareentwicklung • Softwareentwicklung • Theoretische Informatik
ISBN-10	3-540-52590-4 / 3540525904
ISBN-13	978-3-540-52590-5 / 9783540525905
Zustand	Neuware