Jean-Claude Raoult (ed.)

CAAP '92

17th Colloquium on Trees in Algebra and Programming Rennes, France, February 26-28, 1992. Proceedings
Mitarbeit:Raoult, Jean-Claude

• Broschiertes Buch

Produktbeschreibung

This volume contains selected papers presented at theseventeenth Colloquiumon Trees in Algebra and Programming(CAAP) held jointly with the European Symposium onProgramming (ESOP) in Rennes, France, February 26-28, 1992(the proceedings of ESOP appear in LNCS 582). The previouscolloquia were held in France, Italy, Germany, Spain,Denmark and England. Every even year, as in 1992, CAAP isheld jointly with ESOP; every other year, it is part ofTAPSOFT (Theory And Practice of SOFTware development). Inthe beginning, CAAP was devoted to algebraic andcombinatorial properties of trees and their role in variousfields of computer science. The scope of CAAP has now beenextended to other discrete structures, like graphs,equations and transformations of graphs, and their linkswith logical theories. The programme committee received 40submissions, from which 19 papers have been selected forinclusion inthis volume.

Produktdetails

• Lecture Notes in Computer Science 581
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-55251-2
• 1992.
• Seitenzahl: 376
• Erscheinungstermin: 19. Februar 1992
• Englisch, Französisch
• Abmessung: 235mm x 155mm x 21mm
• Gewicht: 622g
• ISBN-13: 9783540552512
• ISBN-10: 3540552510
• Artikelnr.: 09244607

Inhaltsangabe

A constructive valuation interpretation for classical logic and its use in witness extraction.- Varieties of increasing trees.- Origin functions in ?-calculus and term rewriting systems.- An algebraic approach to the interpretation of recursive types.- Decidability of reachability and disjoint union of term rewriting systems.- A complete type inference algorithm for simple intersection types.- Monadic second-order definable graph transductions.- CTL* and ECTL* as fragments of the modal ?-calculus.- Power domains supporting recursion and failure.- Parallel contraction of fibonacci trees and prefix computations on a family of interconnection topologies.- Must preorder in non-deterministic untyped ?-calculus.- A programming language for deriving hypergraphs.- Graph grammars as context-dependent rewriting systems: A partial ordering semantics.- Empty stack Pushdown ?-tree automata.- Modulo counting quantifiers over finite trees.- Finite tree automata with cost functions.- Partial type assignment in left linear applicative term rewriting systems.- A linear algorithm for solving fixed-point equations on transition systems.- Beyond conditional equations.