8. CAAP 1983: L'Aquila, Italy

Giorgio Ausiello, Marco Protasi (Eds.): CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings. Lecture Notes in Computer Science 159 Springer 1983, ISBN 3-540-12727-5 BibTeX

@proceedings{DBLP:conf/caap/1983,
  editor    = {Giorgio Ausiello and
               Marco Protasi},
  title     = {CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila,
               Italy, March 9-11, 1983, Proceedings},
  booktitle = {CAAP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {159},
  year      = {1983},
  isbn      = {3-540-12727-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

Manfred Broy, Martin Wirsing: Generalized Heterogeneous Algebras and Partial Interpretations. 1-34 BibTeX
Mario Coppo, Mariangiola Dezani-Ciancaglini, Giuseppe Longo: Applicative Information Systems. 35-64 BibTeX
Ronald Fagin: Acyclic Database Schemes (of Various Degrees): A Painless Introduction. 65-89 BibTeX
Zvi Galil: Efficient Algorithms for Finding Maximal Matching in Graphs. 90-113 BibTeX
Dirk Janssens, Grzegorz Rozenberg: A Survey of NLC Grammars. 114-128 BibTeX

Contributed Papers

Joffroy Beauquier: Prefix and Perfect Languages. 129-140 BibTeX
Eike Best, M. W. Shields: Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets. 141-154 BibTeX
Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli: VLSI Mesh of Trees for Data Base Processing. 155-166 BibTeX
M. F. Claerebout, Eric Lilin: Continuite des transducteurs d'états finis d'arbes. 167-178 BibTeX
Mario Coppo, Elio Giovannetti: Completeness Results for a Polymorphic Type System. 179-190 BibTeX
Bruno Courcelle, F. Lavandier: A Class of Program Schemes Based on Tree Rewriting Systems. 191-204 BibTeX
François Fages, Gérard P. Huet: Complete Sets of Unifiers and Matchers in Equational Theories. 205-220 BibTeX
Philippe Flajolet, Nasser Saheb: Digital Search Trees and the Generation of an Exponentially Distributed Variate. 221-235 BibTeX
Jacob Gonczaroski: Decidable Properties of Monadic Recursive Schemas with a Depth Parameter. 236-254 BibTeX
Sorin Istrail, Cristian Masalagiu: Nivat-Processing Systems: Decision Problems Related to Protection and Synchronization. 255-268 BibTeX
Jean-Pierre Jouannaud: Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types. 269-283 BibTeX
Andrzej Lingas: An Application of Maximum Bipartite C-Matching to Subtree Isomorphism. 284-299 BibTeX
Bernd Mahr, Johann A. Makowsky: Characterizing Specification Languages Which Admit Initial Semantics. 300-316 BibTeX
Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough: Topological Bandwidth. 317-331 BibTeX
Alberto Marchetti-Spaccamela, Maurizio Talamo: Probabilistic Analysis of Graph Colouring Algorithms. 332-340 BibTeX
Burkhard Monien, Ewald Speckenmeyer: Some Further Approximation Algorithms for the Vertex Cover Problem. 341-349 BibTeX
Jan Paredaens, Dirk Van Gucht: An Application of the Theory of Graphs and Hypergraphs to the Decomposition of Relational Database Schemes. 350-366 BibTeX
Wojciech Rytter: Remarks on the Pyramidal Structure. 367-376 BibTeX
Donald Sannella, Rod M. Burstall: Structured Theories in LCF. 377-391 BibTeX
Giora Slutzki: Alternating Tree Automata. 392-404 BibTeX
Marisa Venturini Zilli: Cofinality in Reduction Graphs. 405-416 BibTeX