Implementation of Functional Languages: 8th International Workshop, IFL'96 Bad Godesberg, Germany, September 16-18, 1996, Selected Papers / Edition 1

by Werner Kluge

Overview

This book contains the strictly refereed post-workshop proceedings originating from the 8th International Workshop on the Implementation of Functional Languages, held in Bad Godesberg, Germany, in September 1996.

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.

Product Details

ISBN-13:	9783540632375
Publisher:	Springer Berlin Heidelberg
Publication date:	08/08/1997
Series:	Lecture Notes in Computer Science , #1268
Edition description:	1997
Pages:	292
Product dimensions:	6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

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.