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.
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.
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.
Inhaltsverzeichnis
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.
Springer Book Archives
