Programming Languages and Systems
Editat de David Schmidten Limba Engleză Paperback – 18 mar 2004
Preț: 792.77 lei
Preț vechi: 990.96 lei
-20% Nou
Puncte Express: 1189
Preț estimativ în valută:
140.29€ • 163.60$ • 123.17£
140.29€ • 163.60$ • 123.17£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540213130
ISBN-10: 3540213139
Pagini: 432
Ilustrații: XII, 420 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:2004
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540213139
Pagini: 432
Ilustrații: XII, 420 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:2004
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Resources, Concurrency, and Local Reasoning.- Relational Abstract Domains for the Detection of Floating-Point Run-Time Errors.- Strong Preservation as Completeness in Abstract Interpretation.- Static Analysis of Digital Filters.- Sound and Decidable Type Inference for Functional Dependencies.- Call-by-Value Mixin Modules.- ML-Like Inference for Classifiers.- From Constraints to Finite Automata to Filtering Algorithms.- A Memoizing Semantics for Functional Logic Languages.- Adaptive Pattern Matching on Binary Data.- Compositional Analysis of Authentication Protocols.- A Distributed Abstract Machine for Boxed Ambient Calculi.- A Dependently Typed Ambient Calculus.- A Control Flow Analysis for Safe and Boxed Ambients.- Linear Types for Packet Processing.- Modal Proofs as Distributed Programs.- ULM: A Core Programming Model for Global Computing.- A Semantic Framework for Designer Transactions.- Semantical Analysis of Specification Logic, 3.- Answer Type Polymorphism in Call-by-Name Continuation Passing.- System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types.- A Hardest Attacker for Leaking References.- Trust Management in Strand Spaces: A Rely-Guarantee Method.- Just Fast Keying in the Pi Calculus.- Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation.- Functors for Proofs and Programs.- Extracting a Data Flow Analyser in Constructive Logic.- Canonical Graph Shapes.
Caracteristici
Includes supplementary material: sn.pub/extras