|
|
|
|
LEADER |
03641nam a22003735i 4500 |
001 |
000288914 |
005 |
20210914100608.0 |
007 |
cr nn 008mamaa |
008 |
170318s2017 gw | s |||| 0|eng d |
020 |
|
|
|a 9783662544341
|
024 |
7 |
|
|a 10.1007/978-3-662-54434-1
|2 doi
|
040 |
|
|
|a Sistema de Bibliotecas del Tecnológico de Costa Rica
|
245 |
1 |
0 |
|a Programming Languages and Systems :
|b 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 /
|c edited by Hongseok Yang.
|
250 |
|
|
|a 1st ed. 2017.
|
260 |
# |
# |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2017.
|
300 |
|
|
|a XV, 992 p. 236 illus. :
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Theoretical Computer Science and General Issues ;
|v 10201
|
505 |
0 |
|
|a 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.
|
650 |
|
0 |
|a Programming languages (Electronic computers).
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Computer programming.
|
650 |
1 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Programming Techniques.
|
700 |
1 |
|
|a Yang, Hongseok.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|