Trees in Algebra and Programming - CAAP '96: 21st International Colloquium, Linköping, Sweden, April 22-24, 1996. Proceedings (Lecture Notes in Computer Science, 1059)

ISBN 10: 3540610642 / ISBN 13: 9783540610649

Editore: Springer, 1996

Riguardo questo articolo

Codice articolo ABLIING23Mar3113020172171

Dati bibliografici

• Titolo: Trees in Algebra and Programming - CAAP '96: 21st International Colloquium, Linköping, Sweden, April 22-24, 1996. Proceedings (Lecture Notes in Computer Science, 1059)
• Editore: Springer
• Data di pubblicazione: 1996
• Lingua: Inglese
• ISBN 10: 3540610642
• ISBN 13: 9783540610649
• Rilegatura: Brossura
• Condizione: New

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.