Foundations of software science and computation structures : 20th 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 /: 20th 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. (2017)

• Record Type: Book
• Other Titles: FOSSACS 2017
• Further Information: Note: Javier Esparza, Andrzej S. Murawski, editors.
• Editors: Esparza, Javier; Murawski, Andrzej S
• Other Names: FOSSACS (Conference), 20th; ETAPS (Conference), 20th, jointly held conference
• Contents: Coherence 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.
• Publisher Details: Berlin, Germany : Springer
• Publication Date: 2017
• Extent: 1 online resource (xvii, 568 pages), illustrations
• Subjects: 005.1; Computer software -- Congresses; Software engineering -- Congresses; Computer software; Software engineering; Electronic books; Electronic books; Conference papers and proceedings
• Languages: English
• ISBNs: 9783662544587; 3662544571; 9783662544570
• Related ISBNs: 366254458X; 9783662544570
• Notes: Note: Includes bibliographical references and author index.; 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.