TAPSOFT '87

Author:   Hartmut Ehrig ,  Robert Kowalski ,  Giorgio Levi ,  Ugo Montanari
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   1987 ed.
Volume:   249
ISBN:  

9783540176602


Pages:   294
Publication Date:   27 February 1987
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $105.47 Quantity:  
Add to Cart

Share |

TAPSOFT '87


Add your own review!

Overview

Full Product Details

Author:   Hartmut Ehrig ,  Robert Kowalski ,  Giorgio Levi ,  Ugo Montanari
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1987 ed.
Volume:   249
Dimensions:   Width: 15.50cm , Height: 1.60cm , Length: 23.50cm
Weight:   0.970kg
ISBN:  

9783540176602


ISBN 10:   3540176608
Pages:   294
Publication Date:   27 February 1987
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List