TAPSOFT '87 : proceedings of the International joint conference on theory and practice of software development, Pisa, Italy, March 23-27, 1987 Volume 1, Advanced seminar on foundations of innovative software development I and Colloquium on trees in algebra and programming (CAAP '87)
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
249 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987, Texte imprimé, 9783540176602 • TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987, Texte imprimé, 9783662201473 • TAPSOFT '87, proceedings of the International joint conference on theory and practice of software development, Pisa, Italy, March 23-27, 1987, Volume 1, Advanced seminar on foundations of innovative software development I and Colloquium on trees in algebra and programming (CAAP '87), edited by Hartmut Ehrig, Robert Kowalski, Giogio Levi and Ugo Montanari, 1987, Berlin, Springer, 1 vol. (XIV-289 p.), Lecture notes in computer science, 3-540-17660-8 |
Table des matières:
- On the complexity of branching programs and decision trees for clique functions
- Average complexity of additive properties for multiway tries: A unified approach
- Longest common factor of two words
- An unification semi-algorithm for intersection type schemes
- Optimal run time optimization proved by a new look at abstract interpretations
- Transformation ordering
- On parametric algebraic specifications with clean error handling
- Toward formal development of programs from algebraic specifications: Implementations revisited
- Finite algebraic specifications of semicomputable data types
- On the semantics of concurrency: Partial orders and transition systems
- CCS without ?'s
- A fully observational model for infinite behaviours of communicating systems
- SMoLCS-driven concurrent calculi
- Parameterized horn clause specifications: Proof theory and correctness
- Partial composition and recursion of module specifications
- Efficient representation of taxonomies
- Applications of compactness in the Smyth powerdomain of streams
- Characterizing Kripke structures in temporal logic
- Dialogue with a proof system
- Induction principles formalized in the calculus of constructions
- Algebraic semantics.