1. TAPSOFT 1985: Berlin, Germany

@proceedings{DBLP:conf/tapsoft/1985-1,
  editor    = {Hartmut Ehrig and
               Christiane Floyd and
               Maurice Nivat and
               James W. Thatcher},
  title     = {Mathematical Foundations of Software Development, Proceedings
               of the International Joint Conference on Theory and Practice
               of Software Development (TAPSOFT), Berlin, Germany, March 25-29,
               1985, Volume 1: Colloquium on Trees in Algebra and Programming
               (CAAP'85)},
  booktitle = {TAPSOFT, Vol.1},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {185},
  year      = {1985},
  isbn      = {3-540-15198-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Advanced Seminar on the Role of Semantics in Software Development

Concepts of Semantics with a View to Software Development

• Manfred Broy: Specification and Top Down Design of Distributed Systems. 4-28 BibTeX
• Pierpaolo Degano, Ugo Montanari: Specification Languages for Distributed Systems. 29-51 BibTeX
• William L. Scherlis, Dana S. Scott: Semantically Based Programming Tools (Summary). 52-59 BibTeX

The Role of Semantics in Language Design

• John W. Backus: From Function Level Semantics to Program Transformation and Optimization. 60-91 BibTeX
• Rod M. Burstall: Inductively Defined Functions (Extended Abstract). 92-96 BibTeX
• John C. Reynolds: Three Approaches to Type Structure. 97-138 BibTeX

Colloquium on Trees in Algebra and Programming

Algorithms and Combinatorics

• Marco Protasi, Maurizio Talamo: On the Maximum Size of Random Trees. 139-144 BibTeX
• Bernard Chazelle: Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity. 145-156 BibTeX
• Pierre-Louis Curien: Typed Categorial Combinatory Logic. 157-172 BibTeX

Rewriting

• Deepak Kapur, Paliath Narendran, G. Sivakumar: A Path Ordering for Proving Termination of Term Rewriting Systems. 173-187 BibTeX
• Deepak Kapur, Mandayam K. Srivas: A Rewrite Rule Based Approach for Synthesizing Abstract Data Types. 188-207 BibTeX
• Michael Karr: "Delayability" in Proofs of Strong Normalizability in the Typed Lambda Calculus. 208-222 BibTeX

Concurrency

• Ilaria Castellani: Bisimulations and Abstraction Homomorphisms. 223-238 BibTeX
• Gerardo Costa: A Metric Characterization of Fair Computations in CCS. 239-252 BibTeX
• Colin Sterling: A Complete Modal Proof System for a Subset of SCCS. 253-266 BibTeX

Graph Grammars and Formal Languages

• Paul Boehm, Harald-Reto Fonio, Annegret Habel: Amalgamation of Graph Transformations with Applications to Synchronization. 267-283 BibTeX
• Ulrike Lichtblau: Decompilation of Control Structures by Means of Graph Transformations. 284-297 BibTeX
• Emanuela Fachini, Margherita Napoli: Synchronized Bottom-Up Tree Automata and L-Systems. 298-307 BibTeX

Specifications

• Donald Sannella, Andrzej Tarlecki: On Observational Equivalence and Algebraic Specification. 308-322 BibTeX
• Peter Padawitz: Parameter Preserving Data Type Specifications. 323-341 BibTeX
• Egidio Astesiano, Gianfranco Mascari, Gianna Reggio, Martin Wirsing: On the Parameterized Algebraic Specification of Concurrent Systems. 342-358 BibTeX

Semantics and Data Types

• Edward K. Blum, Francesco Parisi-Presicce: The Semantics of Shared Submodules Specifications. 359-373 BibTeX
• Johann A. Makowsky: Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples (Extended Abstract). 374-387 BibTeX
• Axel Poigné, Josef Voss: On the Implementation of Abstract Data Types by Programming Language Constructs. 388-402 BibTeX
• Christine Choppy, G. Guiho, Stéphane Kaplan: A Lisp Compiler for FP Language and Its Proof via Algebraic Semantics. 403-415 BibTeX