CAAP '90 : 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15 18, 1990 : proceedings
This volume contains the proceedings of the Fifteenth Colloquium on Trees in Algebra and Programming. The papers selected present new research results and cover the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including th...
שמור ב:
| מחבר תאגידי: | |
|---|---|
| מחברים אחרים: | |
| פורמט: | Livre numérique |
| שפה: | Anglais |
| יצא לאור: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| סדרה: | Lecture notes in computer science
431 |
| נושאים: | |
| גישה מקוונת: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| הערה: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 1990, proceedings, 1990, Berlin, Springer, 1 vol. (VI-284 p.), Lecture notes in computer science, 0-387-52590-4 • CAAP '90, Texte imprimé, 9783662165430 |
| LEADER | 04243nam a22004457a 4500 | ||
|---|---|---|---|
| 001 | 945018 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155211528 | ||
| 020 | |a 9783540470427 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.5 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a Colloquium on trees in algebra and programming |n (15 |d :1990 |c :Copenhague). | |
| 245 | 1 | 0 | |a CAAP '90 : |b 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15 18, 1990 : proceedings |c [edited by] A. Arnold. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 431 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a On the power of bounded concurrency II: The pushdown automata level -- Trees everywhere -- Combinatory forms for equational programming: Instances, unification and narrowing -- Graphical versus logical specifications -- More efficient bottom-up tree pattern matching -- On the regular structure of prefix rewriting -- A unified approach for showing language containment and equivalence between various types of ?-automata -- Unitary monoid with two generators: An algorithmic point of view -- Coherence of subsumption -- Petri nets as models of linear logic -- Towards the unification of models for concurrency -- A markovian concurrency measure -- Graph matching in operational semantics and typing -- ML typability is dexptime-complete -- Testing for inductiue (co)-reducibility -- Probabilistic analysis of some distributed algorithms -- Infinite values in hierarchical imperative types -- Equivalence of finite-valued bottom-up finite state tree transducers is decidable. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis a abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a This volume contains the proceedings of the Fifteenth Colloquium on Trees in Algebra and Programming. The papers selected present new research results and cover the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered as that of sets of discrete structures and the theory of rewriting systems over these objects. - Application of discrete structures in computer science, including syntax and semantics of programming languages, operational semantics, logic programming, algorithms and data structures, complexity of algorithms and implementation aspects, proof techniques for nonnumerical algorithms, formal specifications, and visualization of trees and graphs. | ||
| 650 | |a Génie logiciel | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Arbres (théorie des graphes) |x Informatique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Arnold, André, |d 1945-...., |c mathématicien. |4 pbd | |
| 776 | 0 | |0 021518599 |t CAAP '90 |f 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 1990, proceedings |d 1990 |c Berlin |n Springer |p 1 vol. (VI-284 p.) |s Lecture notes in computer science |z 0-387-52590-4 | |
| 776 | 0 | |t CAAP '90 |b Texte imprimé |z 9783662165430 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-52590-4 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-C4PXQFMV-7 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747914389 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-52590-4 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750927089 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-52590-4 |z Accès INSA CVL | |
| 997 | |0 945018 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||