Gastos de envío:
EUR 2,46
A Estados Unidos de America
Descripción Condición: New. Nº de ref. del artículo: 5899001-n
Descripción Soft Cover. Condición: new. Nº de ref. del artículo: 9783540176602
Descripción Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020161456
Descripción Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Nº de ref. del artículo: ria9783540176602_lsuk
Descripción Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 312 pp. Englisch. Nº de ref. del artículo: 9783540176602
Descripción Condición: New. Nº de ref. del artículo: 5899001-n
Descripción Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783540176602
Descripción Condición: New. Nº de ref. del artículo: V9783540176602
Descripción Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 sch. Nº de ref. del artículo: 4883495
Descripción Condición: New. Nº de ref. del artículo: V9783540176602