Mathematical foundations of software development : proceedings of the International joint conference on theory and practice of software development (TAPSOFT), Berlin, March 25-29, 1985 Volume 1, Colloquium on trees in algebra and programming (CAAP' 85)
Gespeichert in:
| Körperschaften: | , |
|---|---|
| Weitere Verfasser: | , , |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
185 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Variante du titre: | Colloquium on Trees in Algebra and Programming (CAAP' 85) |
| Edition sous un autre format: | • Mathematical foundations of software development, proceedings of the International joint conference on theory and practice of software development (TAPSOFT), Berlin, March 25-29, 1985, Volume 1, Colloquium on trees in algebra and programming (CAAP' 85), Berlin, Springer-Verlag, 1985, 1 vol. (XIII-418 p.), Lecture notes in computer science, 3-540-15198-2 • Mathematical Foundations of Software Development. Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, March 25-29, 1985, Texte imprimé, 9783662198797 |
Inhaltsangabe:
- Specification and top down design of distributed systems
- Specification languages for distributed systems
- Semantically based programming tools (Summary)
- From function level semantics to program transformation and optimization
- Inductively defined functions
- Three approaches to type structure
- On the maximum size of random trees
- Fast searching in a real algebraic manifold with applications to geometric complexity
- Typed categorical combinatory logic
- A path ordering for proving termination of term rewriting systems
- A rewrite rule based approach for synthesizing abstract data types
- Delayability in proofs of strong normalizability in the typed lambda Calculus
- Bisimulations and abstraction homomorphisms
- A metric characterization of fair computations in CCS
- A complete modal proof system for a subset of SCCS
- Amalgamation of graph transformations with applications to synchronization
- Decompilation of control structures by means of graph transformations
- Synchronized bottom-up tree automata and L-systems
- On observational equivalence and algebraic specification
- Parameter preserving data type specifications
- On the parameterized algebraic specification of concurrent systems
- The semantics of shared submodules specifications
- Why Horn formulas matter in computer science: Initial structures and generic examples
- On the implementation of abstract data types by programming language constructs
- A LISP compiler for FP language and its proof via algebraic semantics.