Programming languages and systems : 26th European Symposium on Programming, ESOP 2017, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, proceedings /: 26th European Symposium on Programming, ESOP 2017, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, proceedings. (2017)

• Record Type: Book
• Other Titles: ESOP 2017
• Further Information: Note: Hongseok Yang (ed.).
• Editors: Yang, Hongseok
• Other Names: European Symposium on Programming, 26th; ETAPS (Conference), 20th, jointly held conference
• Contents: Disjoint Polymorphism -- Generalizing inference systems by coaxioms -- Observed Communication Semantics for Classical Processes -- Is your software on dope? -- Formal analysis of surreptitiously "enhanced" programs -- Friends with Benefits: Implementing Corecursion in Foundational Proof Assistants -- Confluence of Graph Rewriting with Interfaces -- Verifying Robustness of Event-Driven Asynchronous Programs against Concurrency -- Incremental update for graph rewriting -- Linearity, Control Effects, and Behavioral Types -- Temporary Read-Only Permissions for Separation Logic -- Faster Algorithms for Weighted Recursive State Machines -- ML and Extended BVASS. -- Metric Reasoning about Lambda Terms: the General Case -- Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring -- Probabilistic Termination by Monadic Affine Sized Typing -- Caper: Automatic Verification for Fine-grained Concurrency -- Tackling Real-Life Relaxed Concurrency with FSL++. -- Extensible Datasort Refinements -- Programs Using Syntax with First-Class Binders. -- Lincx: A Linear Logical Framework with First-class Context -- APLicative Programming with Naperian Functors -- Verified Characteristic Formulae for CakeML -- Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic -- Proving Linearizability Using Partial Orders -- The Power of Non-Determinism in Higher-Order Implicit Complexity -- The Essence of Higher-Order Concurrent Separation Logic -- Comprehending Isabelle/HOL's Consistency.-The essence of functional programming on semantic data -- A Classical Sequent Calculus with Dependent Types -- Context-Free Session Type Inference -- Modular Verification of Higher-order Functional Programs -- Commutative semantics for probabilistic programming -- Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization -- A Higher-Order Logic for Concurrent Termination-Preserving Refinement -- Modular Verification of Procedure Equivalence in the Presence of Memory Allocation -- Abstract Specifications for Concurrent Maps.
• Publisher Details: Berlin, Germany : Springer
• Publication Date: 2017
• Extent: 1 online resource (xv, 992 pages), illustrations
• Subjects: 005.1; Computer programming -- Congresses; Programming languages (Electronic computers) -- Congresses; Computer programming; Programming languages (Electronic computers); Electronic books; Electronic books; Conference papers and proceedings
• Languages: English
• ISBNs: 9783662544341; 3662544342; 3662544334; 9783662544334
• Related ISBNs: 9783662544334
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed April 14, 2017).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.