| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465971903316 |
|
|
Titolo |
TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987 [[electronic resource] ] : 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, Giorgio Levi, Ugo Montanari |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1987.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XVIII, 294 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 249 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Software engineering |
Computer logic |
Mathematical logic |
Software Engineering |
Logics and Meanings of Programs |
Mathematical Logic and Formal Languages |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
| |