3. TAPSOFT 1989: Barcelona, Spain

Josep Díaz, Fernando Orejas (Eds.): TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'89). Lecture Notes in Computer Science 351 Springer 1989, ISBN 3-540-50939-9

Invited Lectures

C. A. R. Hoare:
The Varieties of Programming Language. 1-18
Jean-Louis Lassez, Ken McAloon:
Independence of Negative Constraints. 19-27
Pierre Lescanne:
Completion Procedures as Transition Rules + Control. 28-41
Martin Wirsing, Manfred Broy:
A Modular Framework for Specification and Implementation. 42-73

Communications

Egidio Astesiano, Maura Cerioli:
On the Existence of Initial Models for Partial (Higher-Order) Conditional Specifications. 74-88
Eric Badouel:
Terms and Infinite Trees as Monads Over a Signature. 89-103
Ricardo A. Baeza-Yates:
The Subsequence Graph of a Text. 104-118
Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet:
Syntactical Properties of Unbounded Nets of Processors. 119-133
Stephen L. Bloom, Klaus Sutner:
Shuffle Equations, Parallel Transition Systems and Equational Petri Nets. 134-148
Gérard Boudol:
Towards a Lambda-Calculus for Concurrent and Communicating Systems. 149-161
Antonio Brogi, Roberto Gorrieri:
A Distributed, Net Oriented Semantics for Delta Prolog. 162-177
Arie de Bruin, Erik P. de Vink:
Continuation Semantics for PROLOG with Cut. 178-192
Marie-Pierre Delest, Jean-Marc Fedou:
Labeled Trees and Relations on Generating Functions. 193-206
Pierre Deransart:
Proofs of Declarative Properties of Logic Programs. 207-226
Aline Deruyver, Rémi Gilleron:
The Reachability Problem for Ground TRS and Some Extensions. 227-243
Harald Ganzinger:
Order-Sorted Completion: The Many-Sorted Way (Extended Abstract). 244-258
Martin Gogolla:
Algebraization and Integrity Constraints for an Extended Entity-Relationship Approach. 259-274
Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. 275-289
Rolf Hennicker:
Implementation of Parameterized Observational Specifications. 290-305
Simon M. Kaplan, Steven K. Goering:
Priority Controlled Incremental Attribute Evaluation in Attributed Graph Grammars. 306-336
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi:
Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types. 337-351
Peter Padawitz:
Inductive Proofs by Resolution and Paramodulation. 352-368
Colin Stirling, David Walker:
Local Model Checking in the Modal Mu-Calculus. 369-383