Functional Programming, Glasgow 1990 : Proceedings of the 1990 Glasgow Workshop on Functional Programming 13-15 August 1990, Ullapool, Scotland

Peyton Jones, Simon

ISBN 10: 3540196676 / ISBN 13: 9783540196679

Editore: Springer 1991-04, 1991

Riguardo questo articolo

Codice articolo 6666-IUK-9783540196679

Dati bibliografici

Titolo: Functional Programming, Glasgow 1990 : ...

Casa editrice: Springer 1991-04

Data di pubblicazione: 1991

Legatura: PF

Condizione: New

Descrizione articolo

Riassunto:

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 Compile-Time Garbage Collection by Necessity Analysis Geoff W Hamilton and Simon B. Jones. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 Improving Full Laziness Carsten Kehler Holst . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 Towards Binding-Time Improvement for Free Carsen Kehler Holst and John Hughes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83 Towards Relating Forwards and Backwards Analyses John Hughes and John Launchbury . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 PERs Generalise Projections for Strictness Analysis Sebastian Hunt . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114 Functional Programming with Relations Graham Hutton . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Contenuti:

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.