Cantitate/Preț
Produs

Programming Languages and Systems

Editat de Sophia Drossopoulou
en Limba Engleză Paperback – 18 mar 2008

Preț: 32810 lei

Preț vechi: 41013 lei
-20%

Puncte Express: 492

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 40000 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: 9783540787389
ISBN-10: 3540787380
Pagini: 416
Ilustrații: XIII, 402 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.63 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Semantics, Parametricity, and Types.- A Sound Semantics for OCaml light .- Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!.- Regular Expression Subtyping for XML Query and Update Languages.- Semantics.- A Theory of Hygienic Macros.- A Hybrid Denotational Semantics for Hybrid Systems.- Full Abstraction for Linda.- Practical Programming with Higher-Order Encodings and Dependent Types.- Functional and Logic Programming.- Programming in JoCaml (Tool Demonstration).- Playing with : Constraints and Domain Cooperation.- Typing Safe Deallocation.- Iterative Specialisation of Horn Clauses.- ESOP Invited Talk.- Constructive Mathematics and Functional Programming (Abstract).- Static Analysis.- Ranking Abstractions.- Non-disjunctive Numerical Domain for Array Predicate Abstraction.- Upper Adjoints for Fast Inter-procedural Variable Equalities.- Cover Algorithms and Their Combination.- Security I.- Tapido: Trust and Authorization Via Provenance and Integrity in Distributed Objects (Extended Abstract).- Linear Declassification.- Just Forget It – The Semantics and Enforcement of Information Erasure.- Concurrency.- Open Bisimulation for the Concurrent Constraint Pi-Calculus.- The Conversation Calculus: A Model of Service-Oriented Computation.- Inferring Channel Buffer Bounds Via Linear Programming.- ETAPS Invited Talk.- Verification of Higher-Order Computation: A Game-Semantic Approach.- Program Verification.- Verification of Equivalent-Results Methods.- Semi-persistent Data Structures.- A Realizability Model for Impredicative Hoare Type Theory.- Oracle Semantics for Concurrent Separation Logic.- Security II.- Certificate Translation in Abstract Interpretation.- A Formal Implementation of Value Commitment.