Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	März 2010
Genre:	EDV / Informatik
	C / Compilers & interpreters / Computation by Abstract Devices / Computer architecture & logic design / Computer logic / Computer programming / software engineering / computer science / Computers / Logics and Meanings of Programs / Mathematical logic / Mathematical Logic and Formal Languages / Mathematical Logic and Foundations / Operating systems / Programming & scripting languages# general / Programming languages (Electronic computers) / Programming Languages, Compilers, Interpreters / Software Engineering / Software Engineering/Programming and Operating Systems / Theory of Computation mehr...
ISBN:	9783642120312
EAN-Code:	9783642120312
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#6014 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H / B / D
Gewicht:	623 gr
Seiten:	389
Illustration:	XV, 389 p. 47 illus., schwarz-weiss Illustrationen
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

FoSSaCS 2010 Invited Talk.- to Decidability of Higher-Order Matching.- Semantics of Programming Languages.- A Semantic Foundation for Hidden State.- Linearly-Used Continuations in the Enriched Effect Calculus.- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience.- Completeness for Algebraic Theories of Local State.- Probabilistic and Randomised Computation.- Fair Adversaries and Randomization in Two-Player Games.- Retaining the Probabilities in Probabilistic Testing Theory.- Concurrency and Process Theory.- Forward Analysis of Depth-Bounded Processes.- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization.- Parameterised Multiparty Session Types.- On the Relationship between Spatial Logics and Behavioral Simulations.- Modal and Temporal Logics.- An Easy Completeness Proof for the Modal ?-Calculus on Finite Trees.- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable.- Model Checking Is Static Analysis of Modal Logic.- Counting CTL.- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems.- Verification.- Toward a Compositional Theory of Leftist Grammars and Transformations.- Degrees of Lookahead in Regular Infinite Games.- Reachability Analysis of Communicating Pushdown Systems.- The Complexity of Synchronous Notions of Information Flow Security.- Categorical and Coalgebraic Methods.- Monads Need Not Be Endofunctors.- CIA Structures and the Semantics of Recursion.- Coalgebraic Correspondence Theory.- Lambda Calculus and Types.- Untyped Recursion Schemes and Infinite Intersection Types.- Solvability in Resource Lambda-Calculus.- A Hierarchy for Delimited Continuations in Call-by-Name.