Cover Image
Read Now

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)

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...

Full description

Bibliographic Details
Other Authors: Diaz, Josep (Editor), Orejas, Fernando (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1989, 1989
Edition:1st ed. 1989
Series:Lecture Notes in Computer Science
Subjects:
Computer Systems
Compilers (computer Programs)
Computer Science Logic And Foundations Of Programming
Compilers And Interpreters
Software Engineering
Computer Science
Computer System Implementation
Mathematical Logic
Mathematical Logic And Foundations
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • The varieties of programming language
  • Independence of negative constraints
  • Completion procedures as transition rules + control
  • A modular framework for specification and implementation
  • On the existence of initial models for partial (higher-order) conditional specifications
  • Terms and infinite trees as monads over a signature
  • The subsequence graph of a text
  • Syntactical properties of unbounded nets of processors
  • Shuffle equations, parallel transition systems and equational Petri nets
  • Towards a lambda-calculus for concurrent and communicating systems
  • A distributed, net oriented semantics for Delta Prolog
  • Continuation semantics for PROLOG with cut
  • Labeled trees and relations on generating functions
  • Proofs of declarative properties of logic programs
  • The reachability problem for ground TRS and some extensions
  • Order-sorted completion: The many-sorted way
  • Algebraization and integrity constraints for an extended entity-relationship approach
  • Decidable boundedness problems for hyperedge-replacement graph grammars
  • Implementation of parameterized observational specifications
  • Priority controlled incremental attribute evaluation in attributed graph grammars
  • Some applications and techniques for generating functions
  • Semi-constructive formal systems and axiomatization of abstract data types
  • Inductive proofs by resolution and paramodulation
  • Local model checking in the modal mu-calculus

Similar Items