Conference 
FOSSACS (Conference) (20th : 2017 : Uppsala, Sweden)

Series 
Lecture notes in computer science, 03029743 ; 10203 

Advanced research in computing and software science 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ;
10203.
03029743


Lecture notes in computer science. Advanced research in computing and software science.


LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Subject 
Computer software  Congresses.


Software engineering  Congresses.

Alt Name 
Esparza, Javier,


Murawski, Andrzej S.,


ETAPS (Conference) (20th : 2017 : Uppsala, Sweden), jointly held conference.

Add Title 
FOSSACS 2017 
Description 
1 online resource (xvii, 568 pages) : illustrations. 

polychrome rdacc 
Note 
International conference proceedings. 

Includes author index. 
Contents 
Coherence Spaces and HigherOrder 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 LambdaTerm Has a Long BetaReduction 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 Averageenergy 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 ContextFree Languages  Dynamic Complexity of the Dyck Reachability  Proof Theory  Cyclic Arithmetic is Equivalent to Peano Arithmetic  MartinLof'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 HigherOrder 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 LambdaFree HigherOrder 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 InductiveInductive Type  On the Semantics of Intensionality. 
Summary 
This 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 higherorder 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. 
Bibliography Note 
Includes bibliographical references and author index. 
Note 
Online resource; title from PDF title page (SpringerLink, viewed April 14, 2017). 
ISBN 
9783662544587 (electronic bk.) 

366254458X (electronic bk.) 

3662544571 

9783662544570 

9783662544570 (print) 
ISBN/ISSN 
10.1007/9783662544587 
OCLC # 
982373329 
Additional Format 
Printed edition: 9783662544570 
