Programming Languages and Systems
Editat de Atsushi Ohorien Limba Engleză Paperback – 12 noi 2003
Preț: 329.74 lei
Preț vechi: 412.17 lei
-20%
Puncte Express: 495
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540205364
ISBN-10: 3540205365
Pagini: 448
Ilustrații: XIV, 434 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540205365
Pagini: 448
Ilustrații: XIV, 434 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talk 1.- On a Method of Global Optimization.- Session 1.- Observing Asymmetry and Mismatch.- Expressive Synchronization Types for Inheritance in the Join Calculus.- Term Graph Rewriting for the ?-Calculus.- Useless-Code Elimination and Program Slicing for the Pi-Calculus.- Session 2.- Constraint Functional Logic Programming for Origami Construction.- A Typeful and Tagless Representation for XML Documents.- Dataflow Pointcut in Aspect-Oriented Programming.- Session 3.- Affine-Based Size-Change Termination.- Using Locality of Flow in Dataflow Analyses.- A Differential Fixpoint Evaluation Framework for Non-distributive Systems.- Invited Talk 2.- Model Checking: From Hardware to Software.- Session 4.- Executing Verified Compiler Specification.- Controlling and Optimizing the Usage of One Resource.- Resource Usage Verification.- Automatic Construction of Hoare Proofs from Abstract Interpretation Results.- Session 5.- A Program Inverter for a Functional Language with Equality and Constructors.- Rebuilding a Tree from Its Traversals:.- Type Inference with Structural Subtyping: A Faithful Formalization of an Efficient Constraint Solver.- Session 6.- Continuation Semantics for Parallel Haskell Dialects.- Translating a Continuous-Time Temporal Logic into Timed Automata.- The Semantic Layers of Timber.- Invited Talk 3.- Scrap Your Boilerplate.- Session 7.- Correctness of a Higher-Order Removal Transformation through a Relational Reasoning.- Extensional Polymorphism by Flow Graph Dispatching.- Register Allocation Based on a Reference Flow Analysis.- Lazy Stack Copying and Stack Copy Sharing for the Efficient Implementation of Continuations.