Functional and Logic Programming
Editat de Matthias Blume, Naoki Kobayashi, Germán Vidal-Oriolaen Limba Engleză Paperback – 9 apr 2010
Preț: 324.63 lei
Preț vechi: 405.79 lei
-20% Nou
Puncte Express: 487
Preț estimativ în valută:
57.44€ • 67.45$ • 50.42£
57.44€ • 67.45$ • 50.42£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642122507
ISBN-10: 3642122507
Pagini: 368
Ilustrații: XI, 355 p. 46 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.56 kg
Ediția:2010
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642122507
Pagini: 368
Ilustrații: XI, 355 p. 46 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.56 kg
Ediția:2010
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Fast-track conference proceedings State-of-the-art research Unique visibility