Trees in algebra and programming - CAAP '96 : 21st International Colloquium, Linköping, Sweden, April 22 24, 1996 : proceedings
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 Abramsk...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
1059 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Trees in algebra and programming, CAAP '96, 21st international colloquium, Linköping, Sweden, April 22-24, 1996, proceedings, Hélène Kirchner (ed.), 1996, New York, Springer, 1 vol. (VIII-329 p.), Lecture notes in computer science, 3-540-61064-2 • Trees in Algebra and Programming - CAAP '96, Texte imprimé, 9783662214183 |
Table des matières:
- 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.