Umfang:
Online-Ressource (XIV, 289 S.)
Ausgabe:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540477464
Serie:
Lecture notes in computer science 249
Inhalt:
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.
Anmerkung:
Literaturangaben
Weitere Ausg.:
ISBN 3540176608
Weitere Ausg.:
ISBN 0387176608
Weitere Ausg.:
ISBN 9783540176602
Weitere Ausg.:
Erscheint auch als Druck-Ausgabe Advanced Seminar on Foundations of Innovative Software Development (1 : 1987 : Pisa) Proceedings of the International Joint Conference on Theory and Practice of Software Development ; 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming Berlin [u.a.] : Springer, 1987 ISBN 3540176608
Weitere Ausg.:
ISBN 0387176608
Sprache:
Englisch
Schlagwort(e):
Konferenzschrift
DOI:
10.1007/3-540-17660-8
URL:
Volltext
(lizenzpflichtig)
Bookmarklink
