This volume contains the papers presented at the 3rd Glasgow Workshop on Functional Programming which was held at Ullapool in August, 1990. The papers vary from the theoretical to the pragmatic, with emphasis on the characteristic application in functional programming of theoretical ideas to practical problems. Material is also offered on using functional languages for particular applications and on debugging and profiling functional programmes. Among the other topics addressed are analysis of lifetimes, strictness and heap contents, the relationship between forward and backward analysis, improved programme compilation, partial applications and parallel programming.
Edited by:
Simon L. Peyton Jones, Graham Hutton, Carsten Kehler Holst Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Country of Publication: Germany Edition: Edition. ed. Dimensions:
Height: 216mm,
Width: 138mm,
Spine: 16mm
Weight: 515g ISBN:9783540196679 ISBN 10: 3540196676 Series:Workshops in Computing Pages: 287 Publication Date:30 April 1991 Audience:
College/higher education
,
Professional and scholarly
,
Further / Higher Education
,
Undergraduate
Format:Paperback Publisher's Status: Active
Lifetime Analysis.- Compiling Laziness by Partial Evaluation.- Strictness Analysis in 4D.- An Algorithmic and Semantic Approach to Debugging.- Abstract Interpretation of Term Graph Rewriting Systems.- Compile-Time Garbage Collection by Necessity Analysis.- Improving Full Laziness.- Towards Binding-Time Improvement for Free.- Towards Relating Forwards and Backwards Analyses.- PERs Generalise Projections for Strictness Analysis.- Functional Programming with Relations.- Abstract Interpretation vs. Type Inference: A Topological Perspective.- Analysing Heap Contents in a Graph Reduction Intermediate Language.- Is Compile Time Garbage Collection Worth the Effort?.- Generating a Pattern Matching Compiler by Partial Evaluation.- An Experiment using Term Rewriting Techniques for Concurrency.- Type Refinement in Ruby.- Normal-Order Reduction Using Scan Primitives.- Calculating Lenient Programs’ Performance.- Problems and Proposals for Time and Space Profiling of Functional Programs.- Solid Modelling in HASKELL.- Differentiating Strictness.- Generalising Diverging Sequences of Rewrite Rules by Synthesising New Sorts.- Concurrent Data Manipulation in a Pure Functional Language.