Programming Languages and Systems
Editat de Gert Smolkaen Limba Engleză Paperback – 15 mar 2000
Preț: 328.72 lei
Preț vechi: 410.90 lei
-20% Nou
Puncte Express: 493
Preț estimativ în valută:
58.16€ • 68.37$ • 50.94£
58.16€ • 68.37$ • 50.94£
Carte tipărită la comandă
Livrare economică 28 ianuarie-11 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540672623
ISBN-10: 3540672621
Pagini: 448
Ilustrații: XIII, 428 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540672621
Pagini: 448
Ilustrații: XIII, 428 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Paper.- Functional Nets.- Regular Papers.- Faithful Translations between Polyvariant Flows and Polymorphic Types.- On the Expressiveness of Event Notification in Data-Driven Coordination Languages.- Flow-Directed Closure Conversion for Typed Languages.- Directional Type Checking for Logic Programs: Beyond Discriminative Types.- Formalizing Implementation Strategies for First-Class Continuations.- Correctness of Java Card Method Lookup via Logical Relations.- Compile-Time Debugging of C Programs Working on Trees.- A Calculus for Compiling and Linking Classes.- Abstract Domains for Universal and Existential Properties.- A Type System for Bounded Space and Functional In-Place Update—Extended Abstract.- Secure Information Flow as Typed Process Behaviour.- Implementing Groundness Analysis with Definite Boolean Functions.- The Correctness of Type Specialisation.- Type Classes with Functional Dependencies.- Sharing Continuations: Proofnets for Languages with Explicit Control.- A Calculus for Link-Time Compilation.- Improving the Representation of Infinite Trees to Deal with Sets of Trees.- On the Translation of Procedures to Finite Machines.- A Kleene Analysis of Mobile Ambients.- A 3-Part Type Inference Engine.- First-Class Structures for Standard ML.- Constraint-Based Inter-Procedural Analysis of Parallel Programs.- Alias Types.- Polyvariant Flow Analysis with Constrained Types.- On Exceptions Versus Continuations in the Presence of State.- Equational Reasoning for Linking with First-Class Primitive Modules.
Caracteristici
Includes supplementary material: sn.pub/extras