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 an 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...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
351 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Theory and practice of software development = TAPSOFT'89, vol. 1, proceedings, INTERNATIONAL JOINT CONFERENCE ON THEORY AND PRACTICE OF SOFTWARE DEVELOPMENT, Berlin, Springer, 1989, 1 vol. (X-383 p.), Lecture notes in computer science - LNCS, 3-540-50939-9 • TAPSOFT '89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Texte imprimé, 9783540509394 • TAPSOFT '89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Texte imprimé, 9783662176931 |
Taula de continguts:
- 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.