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.
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.
Les mer
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;
The 21 full revised papers presented were selected from 44 submissions;
Les mer
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.
Les mer
Springer Book Archives
Springer Book Archives
GPSR Compliance
The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this.
If you have any concerns about our products you can contact us on ProductSafety@springernature.com.
In case Publisher is established outside the EU, the EU authorized representative is:
Springer Nature Customer Service Center GmbH
Europaplatz 3
69115 Heidelberg, Germany
ProductSafety@springernature.com
Les mer
Produktdetaljer
ISBN
9783540610649
Publisert
1996-04-03
Utgiver
Vendor
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Høyde
235 mm
Bredde
155 mm
Aldersnivå
Research, UP, P, 05, 06
Språk
Product language
Engelsk
Format
Product format
Heftet
Redaktør