Julian Seward  Home/Search
Context Related
| sunsite.informatik.r...19921907.ps.gz Cached: PS.gz PS This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PDF Image Update HelpPS.gz PS From: sunsite.informatik.rwthaachen... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algorithm. A central notion is to only ever analyse each function once, at its simplest polymorphic instance. Subsequent non-base uses of functions are dealt with by generalising their simplest instance analyses. This generalisation is done using an algorithm developed by Baraki, based on embedding-closure pairs. Compared with an alternative approach of expanding the program out into a collection ... (Update)
Context of citations to this paper: More
.... that strictness analysis has been extended to analyze higher order functions [10] data structures [43, 44] polymorphic functions [1, 20, 40, 6]. 1.3.2 Dependence Analysis In this section, we give a brief overview of the Dependence Analysis approach as presented in [35]...
.... This compares favourably with BHA strictness analysis, for which the corresponding abstract constructors are typically double lifting [Wad87, Sew93]. For T not containing the domain T P z [ T ] is isomorphic to 1, so FFor Int is 1. For Int Int we have T P z [ Int Int...
Cited by: More
PERs from Projections for Binding-Time Analysis - Davis (1995) (Correct)
Strictness Analysis - Another Method - Winikoff (1993) (Correct)
Partitioning Non-strict Languages for Multi-threaded Code Generation - Coorg (1994) (Correct)
Active bibliography (related documents): More All
1.4: Polymorphic Strictness Analysis Using Frontiers - Seward (1992) (Correct)
0.3: Abstract Interpretation of Functional Languages: From Theory to.. - Hunt (1991) (Correct)
0.3: Hyperstrictness and the Parallel Evaluation of Lazy Functional.. - Mintchev (1993) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
Related documents from co-citation: More All
4: Strictness analysis on non-flat domains by abstract interpretation over finite d.. - Wadler
4: A note on Abstract Interpretation of Polymorphic Functions (context) - Baraki - 1991
3: Automatic binding time analysis for a typed -calculus (context) - Nielson, Nielson - 1988
BibTeX entry: (Update)
Julian Seward. Polymorphic Strictness Analysis using Frontiers. In FPCA '93. http://citeseer.ist.psu.edu/article/seward92polymorphic.html More
@inproceedings{ seward92polymorphic,
author = "Julian Seward",
title = "{Polymorphic Strictness Analysis using Frontiers (Draft Version)}",
booktitle = "4th International Workshop on the Parallel Implementation of Functional Languages",
address = "Aachen, Germany, September 28--30",
editor = "Herbert Kuchen and Rita Loogen",
year = "1992",
url = "citeseer.ist.psu.edu/article/seward92polymorphic.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978
113 a non-strict purely functional language (context) - Hudak, Wadler et al. - 1990
54 Strictness analysis on non-flat domains (context) - Wadler - 1987
41 Strictness analysis - a practical approach (context) - Clack, Jones - 1985
28 Strictness analysis and polymorphic invariance (context) - Abramsky - 1985
28 The theory of strictness analysis for higher-order functions (context) - Burn, Hankin et al. - 1985
23 Abstract Interpretation and the Parallel Evaluation of Funct.. (context) - Burn - 1987
21 Abstract Interpretation of Functional Languages: From Theory.. - Hunt - 1991
18 A relational approach to strictness analysis for higher-orde.. - Abramsky, Jensen - 1991
12 Fixed points and frontiers: a new perspective (context) - Hunt, Hankin - 1991
10 Approximate fixed points in abstract interpretation (context) - Hunt, Hankin - 1992
9 A note on abstract interpretation of polymorphic functions (context) - Baraki - 1991
6 Towards a strictness analyser for haskell: Putting theory in.. (context) - Seward - 1991
5 Implementing Functional Languages: A Practical Approach (context) - Jones, Lester - 1992
2 A prototype implementation of projection-based first-order p.. (context) - Kubiak, Hughes et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://sunsite.informatik.rwth-aachen.de/Publications/AIB/1992/): More
LISA - a Lazy Interpreter for a Full-Fledged lambda-Calculus - Rathsack, Scholz (1992) (Correct)
Towards a Logic-Based Reconstruction of Software.. - Jarke, Jeusfeld.. (1992) (Correct)
PASTEL A Parallel Stack-based Implementation of Eager.. - Hogen, Loogen (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC