Cantitate/Preț
Produs

Implementation of Functional Languages: 9th International Workshop, IFL'97, St. Andrews, Scotland, UK, September 10-12, 1997, Selected Papers: Lecture Notes in Computer Science, cartea 1467

Editat de Chris Clack, Kevin Hammond, Tony Davie
en Limba Engleză Paperback – 26 aug 1998
This book constitutes the thoroughly refereed post-workshop proceedings of the 9th International Workshop on Implementation of Functional Languages, IFL'97, held in St. Andrews, Scotland, UK, in September 1997.
The 21 revised full papers presented were selected from the 34 papers accepted for presentation at the workshop during a second round of thorough a-posteriori reviewing. The book is divided in sections on compilation, types, benchmarking and profiling, parallelism, interaction, language design, and garbage collection.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 33075 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 29 iun 1999 33075 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 26 aug 1998 33720 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 33720 lei

Preț vechi: 42149 lei
-20% Nou

Puncte Express: 506

Preț estimativ în valută:
6453 6729$ 5363£

Carte tipărită la comandă

Livrare economică 20 martie-03 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540648499
ISBN-10: 3540648496
Pagini: 392
Ilustrații: X, 382 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.55 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

C--: A portable assembly language.- The brisk machine: A simplified STG machine.- A Haskell to Java Virtual Machine code compiler.- Common subexpressions are uncommon in lazy functional languages.- With-loop-folding in Sac-condensing consecutive array operations.- Types for register allocation.- Types for 0, 1 or many uses.- Fully persistent graphs—which one to choose?.- Auburn: A kit for benchmarking functional data structures.- Complete and partial redex trails of functional computations.- Engineering large parallel functional programs.- Parallelising a large functional program or: Keeping LOLITA busy.- Naira: A parallel 2Haskell compiler.- Lazy thread and task creation in parallel graph-reduction.- DREAM: The distributed Eden abstract machine.- Using multicasting for optimising data-parallelism.- Using concurrent Haskell to develop views over an active repository.- Interactive functional objects in Clean.- Programming in the large: The algebraic-functional language Opal 2?.- Context patterns, part II.- A compacting garbage collector for unidirectional heaps.

Caracteristici

Includes supplementary material: sn.pub/extras