LEADER 00921nam a2200241 i 4500 001 991003477959707536 008 080318s2005 it 000 0 ita d 020 $a1845424387 035 $ab13700728-39ule_inst 040 $aDip.to Filosofia$bita 082 0 $a330 245 00$aEconomics, evolution and the state :$bthe governance of complexity /$cedited by Kurt Dopfer 260 $aCheltenham ;$aNorthampton :$bEdward Elgar,$c2005 300 $avii, 360 p. :$bill. ;$c24 cm 650 4$aEconomia$xevoluzione$vCongressi 650 4$aEconomia politica$vCongressi 700 1 $aDopfer, Kurt 907 $a.b13700728$b28-01-14$c18-03-08 912 $a991003477959707536 945 $aLE005 330 DOP01. 01$g1$i2005000188534$lle005$o-$pE123.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i14696940$z18-03-08 996 $aEconomics, evolution and the state$91229002 997 $aUNISALENTO 998 $ale005$b18-03-08$cm$da $e-$feng$genk$h0$i0 LEADER 05398nam 22006975 450 001 9910483187203321 005 20251113202111.0 010 $a3-662-54458-X 024 7 $a10.1007/978-3-662-54458-7 035 $a(CKB)3710000001127692 035 $a(DE-He213)978-3-662-54458-7 035 $a(MiAaPQ)EBC5578453 035 $a(MiAaPQ)EBC6306843 035 $a(Au-PeEL)EBL5578453 035 $a(OCoLC)982373329 035 $a(Au-PeEL)EBL6306843 035 $a(PPN)20051234X 035 $a(EXLCZ)993710000001127692 100 $a20170315d2017 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFoundations of Software Science and Computation Structures $e20th 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 /$fedited by Javier Esparza, Andrzej S. Murawski 205 $a1st ed. 2017. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2017. 215 $a1 online resource (XVII, 568 p. 59 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10203 311 08$a3-662-54457-1 327 $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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10203 606 $aComputer science 606 $aMachine theory 606 $aCompilers (Computer programs) 606 $aSoftware engineering 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aCompilers and Interpreters 606 $aSoftware Engineering 606 $aTheory of Computation 615 0$aComputer science. 615 0$aMachine theory. 615 0$aCompilers (Computer programs). 615 0$aSoftware engineering. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aCompilers and Interpreters. 615 24$aSoftware Engineering. 615 24$aTheory of Computation. 676 $a005.1015113 702 $aEsparza$b Javier$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMurawski$b Andrzej S$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483187203321 996 $aFoundations of Software Science and Computation Structures$9772187 997 $aUNINA