000			03390nam a22003375i 4500
001			323587
003			MX-SnUAN
005			20160429161642.0
007			cr nn 008mamaa
008			160111s2015 gw | s |||| 0|eng d
020			_a9783662466780 _9978-3-662-46678-0
035			_avtls000424554
039		9	_y201601111054 _zstaff
050		4	_aQA76.9.L63
245	1	0	_aFoundations of software science and computation structures : _b18th international conference, fossacs 2015, held as part of the european joint conferences on theory and practice of software, etaps 2015, london, uk, april 11-18, 2015, proceedings / _cedited by Andrew Pitts.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bSpringer, _c2015.
300			_axvi, 465 páginas : _b92 ilustraciones
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v9034
500			_aSpringer eBooks
505	0		_aInvited Talk -- Polarized Substructural Session Types -- Semantics of Programming Languages I -- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism -- An Infinitary Model of Linear Logic -- Game Semantics and Normalization by Evaluation -- Foundations of Differential Dataflow -- Categorical Models and Logics -- States of Convex Sets -- A Categorical Semantics for Linear Logical Frameworks -- A Completeness Result for Finite ?-bisimulations -- Sequent Calculus in the Topos of Trees -- Modal and Temporal Logics -- Coalgebraic Trace Semantics via Forgetful Logics -- Unifying Hyper and Epistemic Temporal Logics -- Concurrent, Probabilistic and Timed Systems On the Total Variation Distance of Semi-Markov Chains -- Decidable and Expressive Classes of Probabilistic Automata -- Knowledge = Observation + Memory + Computation -- Compositional Metric Reasoning with Probabilistic Process Calculi -- Semantics of Programming Languages II -- Fragments of ML Decidable by Nested Data Class Memory Automata -- Operational Nominal Game Semantics -- Step-Indexed Logical Relations for Probability -- Automata, Games, Verification -- Minimisation of Multiplicity Tree Automata -- Robust Multidimensional Mean-Payoff Games are Undecidable -- The Cyclic-Routing UAV Problem Is PSPACE-Complete -- Typing Weak MSOL Properties -- Logical Aspects of Computational Complexity Three Variables Suffice for Real-Time Logic -- On Presburger Arithmetic Extended with Modulo Counting Quantifiers -- Parity Games of Bounded Tree- and Clique-Width -- Type Theory, Proof Theory and Implicit Computational Complexity -- Programming and Reasoning with Guarded Recursion for Coinductive Types -- The Computational Contents of Ramified Corecurrence -- On the Dependencies of Logical Rules -- On the Mints Hierarchy in First-Order Intuitionistic Logic.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aPitts, Andrew, _eeditor. _9344122
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783662466773
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-662-46678-0 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c323587 _d323587