Trees in algebra and programming - CAAP '94 : 19th International Colloquium, Edinburgh, U.K., April 11 13, 1994 : proceedings
This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to t...
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
787 |
| 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: | • Trees in algebra and programming, CAAP'94, 19th International Colloquium, Edinburgh, U.K., April 1994, proceedings, Sophie Tison, ed, Berlin, Springer-Verlag, 1994, 1 vol. (x, 351 p.), Lecture notes in computer science, 0-387-57879-X • Trees in Algebra and Programming - CAAP '94, Texte imprimé, 9783662208519 |
Kazalo:
- Ordering constraints on trees
- Graph grammars and tree transducers
- Type Preorders
- Compilative constructive negation in constraint logic programs
- A new linear algorithm for Modular Decomposition
- A CPS-translation of the ??-calculus
- A lower bound on the growth of functions computed by tree transductions
- On the decidability of model checking for several ?-calculi and Petri nets
- Generalizations of the periodicity theorem of Fine and Wilf
- Probabilistic domains
- Some results on top-context-free tree languages
- On higher order recursive program schemes
- Graphs and decidable transductions based on edge constraints
- Nondeterministic automata with concurrency relations and domains
- Algebraic and combinatorial properties of simple, coloured walks
- Probabilistic analysis of an election algorithm in a tree
- On the first-order equivalence of call-by-name and call-by-value
- On the modularity of confluence of constructor-sharing term rewriting systems
- Global program analysis in constraint form
- On projective and separable properties
- A rank hierarchy for deterministic tree-walking transducers
- Superposition in picture languages
- A grammar-based data-flow analysis to stop deforestation.