TAPSOFT '87 [electronic resource] : Proceedings of the International' Joint Conference on Theory and Practice of Software Development Pisa, Italy, March 23–27, 1987 /

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.

Bibliographic Details

Main Authors:	Ehrig, Hartmut. editor., Kowalski, Robert. editor., Levi, Giorgio. editor., Montanari, Ugo. editor., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 1987
Subjects:	Computer science., Software engineering., Computer logic., Mathematical logic., Computer Science., Software Engineering., Logics and Meanings of Programs., Mathematical Logic and Formal Languages.,
Online Access:	http://dx.doi.org/10.1007/3-540-17660-8
Tags:	Add Tag No Tags, Be the first to tag this record!