Research Catalog

Title

Trees in algebra and programming--CAAP '96 : 21st international colloquium, Linköping, Sweden, April 22-24, 1996, proceedings / Hélène Kirchner (ed.).

Author

CAAP '96 (21st : 1996 : Linköping, Sweden)

Publication

Berlin ; New York : Springer, 1996.

Items in the Library & Off-site

Details

Additional Authors

Kirchner, H. (Hélène)

Description

viii, 329 pages : illustrations; 24 cm

Summary

"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."--PUBLISHER'S WEBSITE.

Series Statement

Lecture notes in computer science ; 1059

Uniform Title

Lecture notes in computer science ; 1059.

Subject

• Trees (Graph theory) > Data processing > Congresses
• Data structures (Computer science) > Congresses
• Computational complexity > Congresses
• Computational complexity
• Data structures (Computer science)
• Trees (Graph theory) > Data processing
• Computerwiskunde
• Grafen
• Algebra
• Baum Mathematik
• Programmierung
• Kongress
• Arbres (théorie des graphes) > Informatique > Congrès
• Complexité de calcul (informatique) > Congrès
• Structures de données (informatique) > Congrès

Genre/Form

• Conference papers and proceedings.
• Linköping (1996)

Bibliography (note)

• Includes bibliographical references and index.

Contents

Semantics of interaction (invited talk) / S. Abramsky -- The Kronecker product and local computations in graphs / A. Bottreau and Y. Métivier -- Iterative pairs and multitape automata / M. Madonia and S. Varricchio -- Diophantine equations, Presburger arithmetic and finite automata / A. Boudet and H. Comon -- A pumping lemma for output languages of macro tree transducers / A. Kühnemann -- The area determined by underdiagonal lattice paths / D. Merlini, R. Sprugnoli and M.C. Verri -- Extraction of concurrent processes from higher dimensional automata / Y. Takayama -- Axiomatising extended computation tree logic / R. Kaivola -- Final semantics for a higher order concurrent language / M. Lenisa -- The practice of logical framework (invited talk) / F. Pfenning -- Subsumption algorithms based on search trees / L. Bachmair [and others] -- Interaction nets and term rewriting systems (extended abstract) / M. Fernández and I. Mackie -- Computing in unpredictable environments : semantics, reduction strategies, and program transformations / B. Lisper -- Relative normalization in deterministic residual structures / J. Glauert and Z. Khasidashvili -- Termination by absence of infinite chains of dependency pairs / T. Arts -- Confluence without termination via parallel critical pairs / B. Gramlich -- An ordinal calculus for proving termination in term rewriting / E.A. Cichon and H. Touzet -- Behavioural satisfaction and equivalence in concrete model categories / M. Bidoit and A. Tarlecki -- Open maps, behavioural equivalences, and congruences / A. Cheng and M. Nielsen -- Denotational, causal, and operational determinism in event structures / A. Rensink -- Effective longest and infinite reduction paths in untyped [lambda]-calculi / M.H. Sørensen -- Full abstraction for Lambda calculus with resources and convergence testing / G. Boudol and C. Lavatelli -- Untyped Lambda-calculus with input-output / J. Tiuryn and M. Wand.

ISBN

• 3540610642
• 9783540610649

LCCN

96017669

OCLC

• ocm34546921
• 34546921
• SCSB-9185747

Owning Institutions

Princeton University Library