Functional Programming Languages and Computer Architecture
Editat de John Hughesen Limba Engleză Paperback – 7 aug 1991
Preț: 643.34 lei
Preț vechi: 804.18 lei
-20%
Puncte Express: 965
Preț estimativ în valută:
113.76€ • 130.45$ • 98.32£
113.76€ • 130.45$ • 98.32£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540543961
ISBN-10: 3540543961
Pagini: 680
Ilustrații: VIII, 672 p.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 1.01 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540543961
Pagini: 680
Ilustrații: VIII, 672 p.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 1.01 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Type classes and overloading resolution via order-sorted unification.- On the complexity of ML typability with overloading.- Coercive type isomorphism.- Compiler-controlled multithreading for lenient parallel languages.- Multi-thread code generation for dataflow architectures from non-strict programs.- GAML: A parallel implementation of lazy ML.- Functional programming with bananas, lenses, envelopes and barbed wire.- A strongly-typed self-applicable partial evaluator.- Automatic online partial evaluation.- Assignments for applicative languages.- Linearity and laziness.- Syntactic detection of single-threading using continuations.- A projection model of types.- What is an efficient implementation of the ?-calculus?.- Outline of a proof theory of parametricity.- Reasoning about simple and exhaustive demand in higher-order lazy languages.- Strictness analysis in logical form.- A note on abstract interpretation of polymorphic functions.- Incremental polymorphism.- Dynamics in ML.- Implementing regular tree expressions.- Efficient type inference for higher-order binding-time analysis.- Finiteness analysis.- For a better support of static data flow.- An architectural technique for cache-level garbage collection.- M-structures: Extending a parallel, non-strict, functional language with state.- List comprehensions in agna, a parallel persistent object system.- Generating efficient code for lazy functional languages.- Making abstract machines less abstract.- Unboxed values as first class citizens in a non-strict functional language.