TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987
Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP '87)
Published on 27. February 1987
Book
Paperback/Softback
XVIII, 294 pages
978-3-540-17660-2 (ISBN)
Description
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.
More details
Series
Edition
1987 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XVIII, 294 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 17 mm
Weight
476 gr
ISBN-13
978-3-540-17660-2 (9783540176602)
DOI
10.1007/3-540-17660-8
Schweitzer Classification
Content
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.