|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Peter ThiemannPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 1st ed. 2016 Volume: 9632 Dimensions: Width: 15.50cm , Height: 4.10cm , Length: 23.50cm Weight: 1.234kg ISBN: 9783662494974ISBN 10: 3662494973 Pages: 806 Publication Date: 23 March 2016 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of ContentsSimulating Cities: A Software Engineering Perspective.- Regular Programming for Quantitative Properties of Data Streams.- Formalizing Single-assignment Program Verification: an Adaptationcomplete Approach.- Practical Optional Types for Clojure.- A Timed Process Algebra for Wireless Networks with an Application in Routing.- Computing with semirings and weak rig groupoids.- On Hierarchical Communication Topologies in the pi-calculus.- Modular Termination Verification for Non-blocking Concurrency.- Call-by-Push-Value from a Linear Logic point of view.- Visible Type Application.- Automatically Splitting a Two-Stage Lambda Calculus.- Probabilistic NetKAT.-Coordinated Concurrent Programming in Syndicate.- An application of computable distributions to the semantics of probabilistic programming languages.- Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs.- Improving Floating-Point Numbers: a Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations.- Needle & Knot: Binder boilerplate tied up.- On the Relative Expressiveness of Higher-Order Session Processes.- A Realizability Model for a Semantical Value Restriction.- Probabilistic functions and cryptographic oracles in higher order logic.- Extensible and Efficient Automation through Reflective Tactics.- An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs.- Functional Big-step Semantics.- Classical by-need.- Macrofication: Refactoring by Reverse Macro Expansion.- Type Error Diagnosis for Embedded DSLs by Two-Stage Specialized Type Rules.- Actor Services: Modular Verification of Message Passing Programs.- Transfinite Step-indexing: Decoupling Concrete and Logical Steps.- A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs.- The Expressive Power of Monotonic Parallel Composition.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |