CAAP '83 [[electronic resource] ] : Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings / / edited by G. Ausiello, M. Protasi
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
CAAP '83 [[electronic resource] ] : Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings / / edited by G. Ausiello, M. Protasi
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983 |
| Edizione: | 1st ed. 1983. |
| Descrizione fisica: | 1 online resource (X, 418 p.) |
| Disciplina: | 005.1015113 |
| Soggetto topico: | Computer logic |
| Logics and Meanings of Programs | |
| Persona (resp. second.): | AusielloG |
| ProtasiM | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di contenuto: | Generalized heterogeneous algebras and partial interpretations -- Applicative information systems -- Acyclic database schemes (of various degrees): A painless introduction -- Efficient algorithms for finding maximal matching in graphs -- A survey of NLC grammars -- Prefix and perfect languages -- Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets -- VLSI mesh of trees for data base processing -- Continuite des transducteurs d'etats finis d'arbres -- Completeness results for a polymorphic type system -- A class of program schemes based on tree rewriting systems -- Complete sets of unifiers and matchers in equational theories -- Digital search trees and the generation of an exponentially distributed variate -- Decidable properties of monadic recursive schemas with a depth parameter -- Nivat-processing systems: Decision problems related to protection and synchronization -- Confluent and coherent equational term rewriting systems application to proofs in abstract data types -- An application of maximum bipartite c-matching to subtree isomorphism' -- Characterizing specification languages which admit initial semantics -- Topological bandwidth -- Probabilistic analysis of graph colouring algorithms -- Some further approximation algorithms for the vertex cover problem -- An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes -- Remarks on the pyramidal structure -- Structured theories in LCF -- Alternating tree automata -- Cofinality in reduction graphs. |
| Titolo autorizzato: | CAAP '83 |
| ISBN: | 3-540-38714-5 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996466337703316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture Notes in Computer Science, . 0302-9743 ; ; 159