Programming Languages and Systems
Editat de Zhong Shaoen Limba Engleză Paperback – 7 noi 2007
Preț: 329.74 lei
Preț vechi: 412.17 lei
-20%
Puncte Express: 495
Carte tipărită la comandă
Livrare economică 09-23 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: 9783540766360
ISBN-10: 3540766367
Pagini: 448
Ilustrații: XI, 436 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2007
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540766367
Pagini: 448
Ilustrații: XI, 436 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2007
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talk 1.- X10: Concurrent Programming for Modern Architectures.- The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification.- Local Reasoning for Storable Locks and Threads.- Monadic, Prompt Lazy Assertions in Haskell.- Translation Correctness for First-Order Object-Oriented Pattern Matching.- Persistent Oberon: A Programming Language with Integrated Persistence.- More Typed Assembly Languages for Confidentiality.- A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics.- On a Tighter Integration of Functional and Logic Programming.- Invited Talk 2.- Scalable Simulation of Cellular Signaling Networks.- Timed, Distributed, Probabilistic, Typed Processes.- A Probabilistic Applied Pi–Calculus.- Type-Based Verification of Correspondence Assertions for Communication Protocols.- Deriving Compilers and Virtual Machines for a Multi-level Language.- Finally Tagless, Partially Evaluated.- Polymorphic Delimited Continuations.- Adjunct Elimination in Context Logic for Trees.- Positive Arithmetic Without Exchange Is a Subclassical Logic.- Mixed Inductive/Coinductive Types and Strong Normalization.- Invited Talk 3.- Static and Dynamic Analysis: Better Together.- The Semantics of “Semantic Patches” in Coccinelle: Program Transformation for the Working Programmer.- An Efficient SSA-Based Algorithm for Complete Global Value Numbering.- A Systematic Approach to Probabilistic Pointer Analysis.- Complete Lattices and Up-To Techniques.- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract.- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence.- Call-by-Name and Call-by-Value in Normal Modal Logic.- Call-by-Value Is Dual to Call-by-Name, Extended.