Titolo: Trees in Algebra and Programming - CAAP '96: 21st International Colloquium, Link?ping, Sweden, April 22-24, 1996. Proceedings (Lecture Notes in Computer Science)
Editore: Springer
Data di pubblicazione: 1996
Lingua: Inglese
ISBN 10: 3540610642
ISBN 13: 9783540610649
Rilegatura: Paperback
Condizione: Very Good
Peso: 17 once

Descrizione articolo

Riassunto

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.

Contenuti

Semantics of interaction.- The Kronecker product and local computations in graphs.- Iterative pairs and multitape automata.- Diophantine equations, Presburger arithmetic and finite automata.- A pumping lemma for output languages of macro tree transducers.- The area determined by underdiagonal lattice paths.- Extraction of concurrent processes from higher dimensional automata.- Axiomatising extended computation tree logic.- Final semantics for a higher order concurrent language.- The practice of logical frameworks.- Subsumption algorithms based on search trees.- Interaction nets and term rewriting systems (extended abstract).- Computing in unpredictable environments: Semantics, reduction strategies, and program transformations.- Relative normalization in Deterministic Residual Structures.- Termination by absence of infinite chains of dependency pairs.- Confluence without termination via parallel critical pairs.- An ordinal calculus for proving termination in term rewriting.- Behavioural satisfaction and equivalence in concrete model categories.- Open maps, behavioural equivalences, and congruences.- Denotational, causal, and operational determinism in event structures.- Effective longest and infinite reduction paths in untyped ?-calculi.- Full abstraction for lambda calculus with resources and convergence testing.- Untyped lambda-calculus with input-output.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

GuthrieBooks has served central Texas with a choice selection since 1978. We strive to provide an interesting selection and quality service. We specialize in academic works but carry books for all interests.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

GuthrieBooks
TX, U.S.A.

Condizioni di vendita e spedizione

Condizioni di vendita

At this time we accept payment through Visa or Mastercard.

Diritto di recesso

Condizioni di spedizione

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Tariffe di spedizione nazionale per U.S.A.

Tariffe di spedizione nazionale per U.S.A.
Quantit� dell?ordine	Da 4 a 14 giorni lavorativi	Da 3 a 6 giorni lavorativi
Primo articolo	EUR 5.97	EUR 11.95

I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.