|
|
|
|
| LEADER |
03733nam a22003855i 4500 |
| 001 |
000280491 |
| 005 |
20210628141103.0 |
| 007 |
cr nn 008mamaa |
| 008 |
170315s2017 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783662544587
|
| 024 |
7 |
|
|a 10.1007/978-3-662-54458-7
|2 doi
|
| 040 |
|
|
|a Sistema de Bibliotecas del Tecnológico de Costa Rica
|
| 245 |
1 |
0 |
|a Foundations of Software Science and Computation Structures :
|b 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 /
|c edited by Javier Esparza, Andrzej S. Murawski.
|
| 250 |
|
|
|a 1st ed. 2017.
|
| 260 |
# |
# |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2017.
|
| 300 |
|
|
|a XVII, 568 p. 59 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 10203
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
1 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 700 |
1 |
|
|a Esparza, Javier.
|e editor.
|
| 700 |
1 |
|
|a Murawski, Andrzej S.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|