000 05725nam a22006375i 4500
001 978-3-662-54458-7
003 DE-He213
005 20210120143416.0
007 cr nn 008mamaa
008 170315s2017 gw | s |||| 0|eng d
020 _a9783662544587
_9978-3-662-54458-7
024 7 _a10.1007/978-3-662-54458-7
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
072 7 _aUYF
_2thema
082 0 4 _a005.1015113
_223
245 1 0 _aFoundations of Software Science and Computation Structures
_h[electronic resource] :
_b20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings /
_cedited by Javier Esparza, Andrzej S. Murawski.
250 _a1st ed. 2017.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2017.
300 _aXVII, 568 p. 59 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues ;
_v10203
_aLecture Notes in Computer Science
_v10203
505 0 _aCoherence Spaces and Higher-Order Computation -- Coherence Spaces and Uniform Continuity -- The Free Exponential Modality of Probabilistic Coherence Spaces -- From Qualitative to Quantitative Semantics by Change of Base -- Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence.-Algebra and Coalgebra -- Algebra, coalgebra, and minimization in polynomial differential equations -- Equational Theories of Abnormal Termination Based on Kleene Algebra -- Companions, Codensity and Causality -- Nominal Automata with Name Binding -- Games and Automata -- On the existence of weak subgame perfect equilibria -- Optimal Reachability in Divergent Weighted Timed Games -- Bounding Average-energy Games -- Logics of repeating values on data trees and branching counter systems -- Automata, Logic and Formal Languages -- Degree of sequentiality of weighted automata -- Emptiness under isolation and the value problem for hierarchical probabilistic automata -- Partial Derivatives for Context-Free Languages -- Dynamic Complexity of the Dyck Reachability -- Proof Theory -- Cyclic Arithmetic is Equivalent to Peano Arithmetic -- Martin-Lof's Inductive Definitions are Not Equivalent to Cyclic Proofs -- Probability -- On the relationship between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context -- Computing continuous time Markov chains as transformers of unbounded observation functions -- Pointless Learning -- On Higher-Order Probabilistic Subrecursion. – Concurrency -- A Truly Concurrent Game Model of the Asynchronous ᴨ-Calculus -- Local Model Checking in a Logic for True Concurrency -- The Paths to Choreography Extraction -- On the Undecidability of Asynchronous Session Subtyping -- Lambda Calculus and Constructive Proof -- A Lambda-Free Higher-Order Recursive Path Order -- Automated Constructivization of Proofs -- Semantics and Category Theory -- A Light Modality for Recursion -- Unifying Guarded and Unguarded Iteration -- Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive Type -- On the Semantics of Intensionality.
520 _aThis book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aProgramming languages (Electronic computers).
650 0 _aSoftware engineering.
650 0 _aComputers.
650 1 4 _aLogics and Meanings of Programs.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
650 2 4 _aMathematical Logic and Formal Languages.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16048
650 2 4 _aProgramming Languages, Compilers, Interpreters.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I14037
650 2 4 _aSoftware Engineering.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I14029
650 2 4 _aComputation by Abstract Devices.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16013
700 1 _aEsparza, Javier.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMurawski, Andrzej S.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662544570
776 0 8 _iPrinted edition:
_z9783662544594
830 0 _aTheoretical Computer Science and General Issues ;
_v10203
830 0 _aLecture Notes in Computer Science ;
_v10203
856 4 0 _uhttps://doi.org/10.1007/978-3-662-54458-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c58283
_d58283