Cantitate/Preț
Produs

Programming Languages and Systems

Editat de Peter Thiemann
en Limba Engleză Paperback – 23 mar 2016
This bookconstitutes the proceedings of the 25th European Symposium on Programming, ESOP2016, which took place in Eindhoven, The Netherlands, in April 2016, held asPart of the European Joint Conferences on Theory and Practice of Software,ETAPS 2016.
The 29 papers presented in this volume were carefully reviewed and selectedfrom 98 submissions. Being devoted to fundamental issues in the specification,design, analysis, and implementation of programming languages and systems, ESOPfeatures contributions on all aspects of programming language research;theoretical and/or practical advances. 
Citește tot Restrânge

Preț: 34880 lei

Preț vechi: 43600 lei
-20%

Puncte Express: 523

Preț estimativ în valută:
6163 7144$ 5375£

Carte tipărită la comandă

Livrare economică 15-29 mai


Specificații

ISBN-13: 9783662494974
ISBN-10: 3662494973
Pagini: 820
Ilustrații: XIII, 806 p. 32 illus.
Dimensiuni: 155 x 235 x 44 mm
Greutate: 1.22 kg
Ediția:1st edition 2016
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Cuprins

Simulating Cities: A Software Engineering Perspective.-Regular Programming for Quantitative Properties of Data Streams.- FormalizingSingle-assignment Program Verification: an Adaptationcomplete Approach.- PracticalOptional Types for Clojure.- A Timed Process Algebra for Wireless Networks withan Application in Routing.- Computing with semirings and weak rig groupoids.- OnHierarchical Communication Topologies in the pi-calculus.- Modular TerminationVerification for Non-blocking Concurrency.- Call-by-Push-Value from a LinearLogic point of view.- Visible Type Application.- Automatically Splitting aTwo-Stage Lambda Calculus.- Probabilistic NetKAT.-Coordinated ConcurrentProgramming in Syndicate.- An application of computable distributions to thesemantics of probabilistic programming languages.- Weakest PreconditionReasoning for Expected Run-Times of Probabilistic Programs.- ImprovingFloating-Point Numbers: a Lazy Approach to Adaptive Accuracy Refinement forNumerical Computations.- Needle & Knot: Binder boilerplate tied up.- On theRelative Expressiveness of Higher-Order Session Processes.- A RealizabilityModel for a Semantical Value Restriction.- Probabilistic functions andcryptographic oracles in higher order logic.- Extensible and EfficientAutomation through Reflective Tactics.- An Algorithm Inspired by ConstraintSolvers to Infer Inductive Invariants in Numeric Programs.- Functional Big-stepSemantics.- Classical by-need.- Macrofication: Refactoring by Reverse MacroExpansion.- Type Error Diagnosis for Embedded DSLs by Two-Stage Specialized TypeRules.- Actor Services: Modular Verification of Message Passing Programs.- TransfiniteStep-indexing: Decoupling Concrete and Logical Steps.- A Higher-Order AbstractSyntax Approach to Verified Transformations on Functional Programs.- TheExpressive Power of Monotonic Parallel Composition.

Caracteristici

Includes supplementary material: sn.pub/extras