TAPSOFT '89 is the Third International Joint Conference on Theory and Practice of Software Development held in Barcelona, Spain, March 13-17, 1989. The conference consisted of three parts: - Advanced Seminar on Foundations of Innovative Software Development - Colloquium on Trees in Algebra and Programming (CAAP '89) - Colloquium on Current Issues in Programming Languages (CCIPL) The TAPSOFT '89 Conference Proceedings are published in two volumes. The first volume includes the papers from CAAP plus the more theoretical ones of the invited papers. The second volume comprises the papers from CCIPL and the invited papers more relevant to current issues in programming languages.
Author(s): C. A. R. Hoare (auth.), Josep Díaz, Fernando Orejas (eds.)
Series: Lecture Notes in Computer Science 351
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1989
Language: English
Pages: 383
Tags: Software Engineering; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages
The varieties of programming language....Pages 1-18
Independence of negative constraints....Pages 19-27
Completion procedures as transition rules + control....Pages 28-41
A modular framework for specification and implementation....Pages 42-73
On the existence of initial models for partial (higher-order) conditional specifications....Pages 74-88
Terms and infinite trees as monads over a signature....Pages 89-103
The subsequence graph of a text....Pages 104-118
Syntactical properties of unbounded nets of processors....Pages 119-133
Shuffle equations, parallel transition systems and equational Petri nets....Pages 134-148
Towards a lambda-calculus for concurrent and communicating systems....Pages 149-161
A distributed, net oriented semantics for Delta Prolog....Pages 162-177
Continuation semantics for PROLOG with cut....Pages 178-192
Labeled trees and relations on generating functions....Pages 193-206
Proofs of declarative properties of logic programs....Pages 207-226
The reachability problem for ground TRS and some extensions....Pages 227-243
Order-sorted completion: The many-sorted way....Pages 244-258
Algebraization and integrity constraints for an extended entity-relationship approach....Pages 259-274
Decidable boundedness problems for hyperedge-replacement graph grammars....Pages 275-289
Implementation of parameterized observational specifications....Pages 290-305
Priority controlled incremental attribute evaluation in attributed graph grammars....Pages 306-320
Some applications and techniques for generating functions....Pages 321-336
Semi-constructive formal systems and axiomatization of abstract data types....Pages 337-351
Inductive proofs by resolution and paramodulation....Pages 352-368
Local model checking in the modal mu-calculus....Pages 369-383
