Functional and Logic Programming
Editat de Aart Middeldorp, Taisuke Satoen Limba Engleză Paperback – 27 oct 1999
Preț: 326.68 lei
Preț vechi: 408.36 lei
-20%
Puncte Express: 490
Carte tipărită la comandă
Livrare economică 28 iulie-11 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540666776
ISBN-10: 354066677X
Pagini: 388
Ilustrații: X, 378 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.59 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354066677X
Pagini: 388
Ilustrații: X, 378 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.59 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Semantics and Types in Functional Logic Programming.- Polytypic Programming With Ease.- Type Inference for Overloading without Restrictions, Declarations or Annotations.- Partial Evaluation and Non-interference for Object Calculi.- Lazy Lexing is Fast.- A Functional-Logic Perspective of Parsing.- Implementing Encapsulated Search for a Lazy Functional Logic Language.- Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers.- Automatic Verification Based on Abstract Interpretation.- A Transformation System for Lazy Functional Logic Programs.- Termination Analysis of Tabled Logic Programs Using Mode and Type Information.- On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems.- An Interval Lattice-Based Constraint Solving Framework for Lattices.- Higher Order Matching for Program Transformation.- Automated Generalisation of Function Definitions.- An Extensional Characterization of Lambda-Lifting and Lambda-Dropping.- Using Types as Approximations for Type Checking Prolog Programs.- Typed Static Analysis: Application to Groundness Analysis of Prolog and ? Prolog.- A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs.- The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code.- On Reducing the Search Space of Higher-Order Lazy Narrowing.- Typed Higher-Order Narrowing without Higher-Order Strategies.- A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages.