Artículos relacionados a Foundations of Software Science and Computation Structures:...

Foundations of Software Science and Computation Structures: 19th International Conference, FOSSACS 2016, Held as Part of the European Joint ... The ... The Netherlands, April 2-8, 2016, Proceedin - Tapa blanda

 
9783662496312: Foundations of Software Science and Computation Structures: 19th International Conference, FOSSACS 2016, Held as Part of the European Joint ... The ... The Netherlands, April 2-8, 2016, Proceedin

Esta edición ISBN ya no está disponible.

Sinopsis

Types.- Comprehensive parametric polymorphism: categorical models and type theory.- Guarded Dependent Type Theory with Coinductive Types.- Dependent Types and Fibred Computational Effects.- Game Semantics for Bounded Polymorphism.- Recursion and Fixed-Points Join Inverse Categories as Models of Reversible Recursion.- A Coalgebraic View of Bar Recursion and Bar Induction.- A New Foundation for Finitary Corecursion.- Fixed-point elimination in the Intuitionistic Propositional Calculus.- Verification and Program Analysis. A Theory of Monitors.- Contextual approximation and higher-order procedures.- A Theory of Slicing for Probabilistic Control Flow Graphs.- Verification of parameterized communicating automata via split-width.- Automata, Logic, Games - Robust Equilibria in Mean-Payoff Games.- Quantifier Alternation for Infinite Words.-Synchronizing automata over nested words.- On Freeze LTL with Ordered Attributes.- Regular transformations of data words through origin information.- Probabilistic and Timed Systems - Trace Refinement in Labelled Markov Decision Processes.- Qualitative Analysis of VASS-Induced MDPs.- Metric Temporal Logic with Counting.- Distributed Synthesis in Continuous Time.- Proof Theory and Lambda Calculus Unary Resolution: Characterizing Ptime.- Focused and Synthetic Nested Sequents.- Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda-terms.- Reasoning about call-by-need by means of types.- Algorithms for Infinite Systems Coverability Trees for Petri Nets with Unordered Data.- Shortest paths in one-counter systems.- The Invariance Problem for Matrix Semigroups.- Order-Sorted Rewriting and Congruence Closure.- Monads.- Towards a formal theory of graded monads.- Profinite Monads, Profinite Equations, and Reiterman's Theorem.

"Sinopsis" puede pertenecer a otra edición de este libro.

(Ningún ejemplar disponible)

Buscar:



Crear una petición

¿No encuentra el libro que está buscando? Seguiremos buscando por usted. Si alguno de nuestros vendedores lo incluye en IberLibro, le avisaremos.

Crear una petición

Otras ediciones populares con el mismo título

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

Edición Destacada

ISBN 10:  3662496291 ISBN 13:  9783662496299
Editorial: Springer, 2016
Tapa blanda