Implementation of Functional Languages
Editat de Werner Klugeen Limba Engleză Paperback – 2 iul 1997
The 15 thoroughly revised full papers presented were selected after a second round of reviewing from the 26 contributions accepted for presentation at the workshop. Also included is an overview by the volume editor. The volume addresses various implementational issues of functional languages including parallel implementations, language concepts and design, type systems, interpretation and compilation techniques, automatic program generation, concurrent processing, machine architectures, runtime profiling and application programming.
Preț: 321.39 lei
Preț vechi: 401.73 lei
-20%
Puncte Express: 482
Preț estimativ în valută:
56.88€ • 66.47$ • 49.38£
56.88€ • 66.47$ • 49.38£
Carte tipărită la comandă
Livrare economică 19 februarie-05 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540632375
ISBN-10: 3540632379
Pagini: 304
Ilustrații: XII, 292 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540632379
Pagini: 304
Ilustrații: XII, 292 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Introducing CLOVER: An object-oriented functional language.- Active patterns.- Context patterns in Haskell.- The GRIN project: A highly optimising back end for lazy functional languages.- On programming scientific applications in SAC — A functional language extended by a subsystem for high-level array operations.- The implementation and efficiency of arrays in clean 1.1.- Implementing the conjugate gradient algorithm in a functional language.- An implementation of Eden on top of concurrent Haskell.- Coordinating functional processes using Petri nets.- Making a packet: Cost-effective communication for a parallel graph reducer.- The results of: Profiling large-scale lazy functional programs.- Two-pass heap profiling: A matter of life and death.- First class file I/O.- A type-based algorithm for the control-flow analysis of higher-order concurrent programs.- Calculating a functional module for binary search trees.