Programs as Data Objects
Editat de Olivier Danvy, Andrzej Filinskien Limba Engleză Paperback – 25 apr 2001
Preț: 321.94 lei
Preț vechi: 402.43 lei
-20%
Puncte Express: 483
Preț estimativ în valută:
56.93€ • 65.28$ • 49.20£
56.93€ • 65.28$ • 49.20£
Carte tipărită la comandă
Livrare economică 28 aprilie-12 mai
Specificații
ISBN-13: 9783540420682
ISBN-10: 3540420681
Pagini: 296
Ilustrații: X, 286 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540420681
Pagini: 296
Ilustrații: X, 286 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Head First HTML and CSSElisabeth Robson-20%Preț: 285.09 lei356.37 lei -
KanbanDavid J. Anderson-20%Preț: 249.74 lei312.18 lei -
Preț: 285.95 lei -
Professional GitB LasterPreț: 290.34 lei -
Automatic Program Development: A Tribute to Robert PaigeOlivier Danvy-20%Preț: 626.25 lei782.82 lei -
Pro ASP.NET Web API Security: Securing ASP.NET Web APIBadrinarayanan Lakshmiraghavan-20%Preț: 521.46 lei651.81 lei -
Android CookbookIan F Darwin-20%Preț: 408.59 lei510.73 lei -
Continuous Delivery with Visual Studio ALM 2015Mathias Olausson-20%Preț: 297.01 lei371.26 lei -
The Enterprise Big Data LakeAlex Gorelik-20%Preț: 351.60 lei439.50 lei -
Feature Engineering for Machine LearningAlice Zheng-20%Preț: 326.54 lei408.17 lei -
Mastering ServiceNow - Second EditionMartin Wood-20%Preț: 367.33 lei459.16 lei -
Partial EvaluationOlivier Danvy-20%Preț: 334.04 lei417.55 lei -
-20%Preț: 329.74 lei412.17 lei
Public țintă
ResearchCuprins
Invited Opening Talk.- Program Analysis for Implicit Computational Complexity.- Contributed Papers.- Deriving Pre-conditions for Array Bound Check Elimination.- Type Systems for Useless-Variable Elimination.- Boolean Constraints for Binding-Time Analysis.- Constraint Abstractions.- Implementing Circularity Using Partial Evaluation.- Combining Forward And Backward Analyses of Temporal Properties.- Numerical Power Analysis.- Run-Time Bytecode Specialization.- A New Numerical Abstract Domain Based on Difference-Bound Matrices.- Partial Evaluation for Class-Based Object-Oriented Languages.- Driving in the Jungle.- Higher-Order Pattern Matching for Automatically Applying Fusion Transformations.- Dynamic Partial Evaluation.- Tag Elimination and Jones-Optimality.- Invited Closing Talk.- Bottom-Up Deduction with Deletion and Priorities.
Caracteristici
Includes supplementary material: sn.pub/extras