Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	April 2010
Genre:	EDV / Informatik
	Artificial Intelligence / C / Compiler und Übersetzer / Compilers & interpreters / Computer architecture & logic design / Computer logic / Computer programming / Computer programming / software engineering / computer science / Formal Languages and Automata Theory / Künstliche Intelligenz / Logics and Meanings of Programs / Mathematical logic / Mathematical Logic and Formal Languages / Mathematical Logic and Foundations / Mathematical theory of computation / Programming & scripting languages# general / Programming languages (Electronic computers) / Programming Languages, Compilers, Interpreters / Programming Techniques / Software Engineering / Theoretische Informatik / Theory of Computation mehr...
ISBN:	9783642122507
EAN-Code:	9783642122507
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#6009 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H / B / D
Gewicht:	563 gr
Seiten:	355
Illustration:	XI, 355 p. 46 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:

Invited Talks.- Beluga: Programming with Dependent Types, Contextual Data, and Contexts.- Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs.- Solving Constraint Satisfaction Problems with SAT Technology.- Refereed Papers.- A Church-Style Intermediate Language for ML F .- ??: Dependent Types without the Sugar.- Haskell Type Constraints Unleashed.- A Functional Framework for Result Checking.- Tag-Free Combinators for Binding-Time Polymorphic Program Generation.- Code Generation via Higher-Order Rewrite Systems.- A Complete Axiomatization of Strict Equality.- Standardization and Böhm Trees for ??-Calculus.- An Integrated Distance for Atoms.- A Pearl on SAT Solving in Prolog.- Automatically Generating Counterexamples to Naive Free Theorems.- Applying Constraint Logic Programming to SQL Test Case Generation.- Internal Normalization, Compilation and Decompilation for System .- Towards Normalization by Evaluation for the ??-Calculus of Constructions.- Defunctionalized Interpreters for Call-by-Need Evaluation.- Complexity Analysis by Graph Rewriting.- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and ?-Calculus.- Proving Injectivity of Functions via Program Inversion in Term Rewriting.- Delimited Control in OCaml, Abstractly and Concretely: System Description.- Automatic Parallelization of Recursive Functions Using Quantifier Elimination.- A Skeleton for Distributed Work Pools in Eden.