CAAP '92
Editat de Jean-Claude Raoulten Limba Engleză Paperback – 19 feb 1992
Preț: 326.05 lei
Preț vechi: 407.56 lei
-20%
Puncte Express: 489
Preț estimativ în valută:
57.61€ • 66.41$ • 50.30£
57.61€ • 66.41$ • 50.30£
Carte tipărită la comandă
Livrare economică 16-30 mai
Specificații
ISBN-13: 9783540552512
ISBN-10: 3540552510
Pagini: 376
Ilustrații: IX, 491 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540552510
Pagini: 376
Ilustrații: IX, 491 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.