| TÃtulo : |
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 |
| Tipo de documento: |
documento electrónico |
| Autores: |
Esparza, Javier, ; Murawski, Andrzej S., |
| Mención de edición: |
1 ed. |
| Editorial: |
Berlin [Alemania] : Springer |
| Fecha de publicación: |
2017 |
| Número de páginas: |
XVII, 568 p. 59 ilustraciones |
| ISBN/ISSN/DL: |
978-3-662-54458-7 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
Ciencias de la Computación TeorÃa de las máquinas Compiladores (programas informáticos) IngenierÃa de software Lógica informática y fundamentos de la programación Lenguajes formales y teorÃa de los autómatas Compiladores e intérpretes TeorÃa de la Computación |
| Ãndice Dewey: |
40.151 |
| Resumen: |
Este libro constituye las actas de la 20.ª Conferencia Internacional sobre Fundamentos de la Ciencia del Software y Estructuras de Computación, FOSSACS 2017, que tuvo lugar en Uppsala, Suecia, en abril de 2017, como parte de las Conferencias Conjuntas Europeas sobre TeorÃa y Práctica del Software, ETAPS 2017. Los 32 artÃculos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 101 presentaciones. Estaban organizados en secciones temáticas denominadas: espacios de coherencia y computación de orden superior; álgebra y coalgebra; juegos y autómatas; autómatas, lógica y lenguajes formales; teorÃa de la prueba; probabilidad; concurrencia; cálculo lambda y prueba constructiva; y semántica y teorÃa de categorÃas. |
| Nota de contenido: |
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. |
| En lÃnea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
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 [documento electrónico] / Esparza, Javier, ; Murawski, Andrzej S., . - 1 ed. . - Berlin [Alemania] : Springer, 2017 . - XVII, 568 p. 59 ilustraciones. ISBN : 978-3-662-54458-7 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Ciencias de la Computación TeorÃa de las máquinas Compiladores (programas informáticos) IngenierÃa de software Lógica informática y fundamentos de la programación Lenguajes formales y teorÃa de los autómatas Compiladores e intérpretes TeorÃa de la Computación |
| Ãndice Dewey: |
40.151 |
| Resumen: |
Este libro constituye las actas de la 20.ª Conferencia Internacional sobre Fundamentos de la Ciencia del Software y Estructuras de Computación, FOSSACS 2017, que tuvo lugar en Uppsala, Suecia, en abril de 2017, como parte de las Conferencias Conjuntas Europeas sobre TeorÃa y Práctica del Software, ETAPS 2017. Los 32 artÃculos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 101 presentaciones. Estaban organizados en secciones temáticas denominadas: espacios de coherencia y computación de orden superior; álgebra y coalgebra; juegos y autómatas; autómatas, lógica y lenguajes formales; teorÃa de la prueba; probabilidad; concurrencia; cálculo lambda y prueba constructiva; y semántica y teorÃa de categorÃas. |
| Nota de contenido: |
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. |
| En lÃnea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
|  |
Hacer una sugerencia Refinar búsqueda
