CAAP '92 : 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26 28, 1992 : proceedings
This volume contains selected papers presented at the seventeenth Colloquiumon Trees in Algebra and Programming (CAAP) held jointly with the European Symposium on Programming (ESOP) in Rennes, France, February 26-28, 1992 (the proceedings of ESOP appear in LNCS 582). The previous colloquia were held...
Shranjeno v:
| Korporativna značnica: | |
|---|---|
| Drugi avtorji: | |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
581 |
| Teme: | |
| Online dostop: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Sporočilo: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CAAP '92, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, proceedings, J.-C. Raoult, ed, Berlin, Springer-Verlag, 1992, 1 vol. (viii, 361 p.), Lecture notes in computer science, 3-540-55251-0 • CAAP '92, Texte imprimé, 9783662162415 |
Kazalo:
- A constructive valuation interpretation for classical logic and its use in witness extraction
- Varieties of increasing trees
- Origin functions in ?-calculus and term rewriting systems
- An algebraic approach to the interpretation of recursive types
- Decidability of reachability and disjoint union of term rewriting systems
- A complete type inference algorithm for simple intersection types
- Monadic second-order definable graph transductions
- CTL* and ECTL* as fragments of the modal ?-calculus
- Power domains supporting recursion and failure
- Parallel contraction of fibonacci trees and prefix computations on a family of interconnection topologies
- Must preorder in non-deterministic untyped ?-calculus
- A programming language for deriving hypergraphs
- Graph grammars as context-dependent rewriting systems: A partial ordering semantics
- Empty stack Pushdown ?-tree automata
- Modulo counting quantifiers over finite trees
- Finite tree automata with cost functions
- Partial type assignment in left linear applicative term rewriting systems
- A linear algorithm for solving fixed-point equations on transition systems
- Beyond conditional equations.