Verwandte Artikel zu Foundations of Software Science and Computation Structures:...

Foundations of Software Science and Computation Structures: 20th International Conference, FOSSACS 2017, Held as Part of the European Joint ... ... Sweden, April 22-29, 2017, Proceedings - Softcover

 
9783662544594: Foundations of Software Science and Computation Structures: 20th International Conference, FOSSACS 2017, Held as Part of the European Joint ... ... Sweden, April 22-29, 2017, Proceedings

Zu dieser ISBN ist aktuell kein Angebot verfügbar.

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

  • VerlagSpringer
  • Erscheinungsdatum2017
  • ISBN 10 3662544598
  • ISBN 13 9783662544594
  • EinbandPaperback
  • SpracheEnglisch
  • Kontakt zum HerstellerNicht verfügbar

(Keine Angebote verfügbar)

Buch Finden:



Kaufgesuch aufgeben

Sie kennen Autor und Titel des Buches und finden es trotzdem nicht auf ZVAB? Dann geben Sie einen Suchauftrag auf und wir informieren Sie automatisch, sobald das Buch verfügbar ist!

Kaufgesuch aufgeben

Weitere beliebte Ausgaben desselben Titels

9783662544570: Foundations of Software Science and Computation Structures: 20th International Conference, FOSSACS 2017, Held as Part of the European Joint ... Computer Science and General Issues)

Vorgestellte Ausgabe

ISBN 10:  3662544571 ISBN 13:  9783662544570
Verlag: Springer, 2017
Softcover