Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Juni 2004
Genre:	EDV / Informatik
	C / Compiler und Übersetzer / Compilers & interpreters / Compilers and Interpreters / Computation by Abstract Devices / Computer architecture & logic design / Computer logic / Computer programming / software engineering / computer science / Computer Science Logic and Foundations of Programming / Computers / Formal Languages and Automata Theory / Logics and Meanings of Programs / Mathematical logic / Mathematical Logic and Formal Languages / Mathematical theory of computation / Operating systems / Programming & scripting languages# general / Programming languages (Electronic computers) / Programming Languages, Compilers, Interpreters / Software Engineering / Software Engineering/Programming and Operating Systems / Theoretische Informatik / Theory of Computation mehr...
ISBN:	9783540223801
EAN-Code:	9783540223801
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#3125 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	1280 gr
Seiten:	404
Illustration:	X, 404 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Invited Talk.- Extended Static Checking for Java.- Contributed Papers.- Constructing Polymorphic Programs with Quotient Types.- Optimizing Generic Functions.- Inferring Type Isomorphisms Generically.- Friends Need a Bit More: Maintaining Invariants Over Shared State.- Chasing Bottoms.- Describing Gen/Kill Static Analysis Techniques with Kleene Algebra.- A Free Construction of Kleene Algebras with Tests.- Streaming Representation-Changers.- Probabilistic Predicative Programming.- An Algebra of Scans.- Compiling Exceptions Correctly.- Modelling Nondeterminism.- Lazy Kleene Algebra.- Augmenting Types with Unbounded Demonic and Angelic Nondeterminacy.- An Injective Language for Reversible Computation.- Prototyping Generic Programming in Template Haskell.- Transposing Relations: From Maybe Functions to Hash Tables.- Pointer Theory and Weakest Preconditions without Addresses and Heap.- Travelling Processes.