|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
| |
3
|
|
 |
4
|
|
| |
5
|
BURN, G. 1990b. Using projection analysis in compiling lazy functional programs. In A CM Conference on L~sp and Functwnal Programming. ACM, New York.
|
| |
6
|
|
 |
7
|
R. M. Burstall , D. B. MacQueen , D. T. Sannella, HOPE: An experimental applicative language, Proceedings of the 1980 ACM conference on LISP and functional programming, p.136-143, August 25-27, 1980, Stanford University, California, United States
[doi> 10.1145/800087.802799]
|
| |
8
|
|
 |
9
|
|
 |
10
|
|
| |
11
|
|
| |
12
|
|
 |
13
|
|
 |
14
|
|
 |
15
|
|
| |
16
|
HUET, G. AND LEVY, J. 1979. Computations in nonambiguous linear term rewriting systems. Tech. Rep. 359, IRIA, Le Chesney, France.
|
| |
17
|
|
| |
18
|
HUGHES, R. AND LAUNCHBURY, J. 1992a. Projections for polymorphic first-order strictness analysis. Math. Struct. Comput. Sci. 2, 301-326.
|
| |
19
|
|
| |
20
|
|
| |
21
|
|
 |
22
|
O. Kaser , S. Pawagi , C. R. Ramakrishnan , I. V. Ramakrishnan , R. C. Sekar, Fast parallel implementation of lazy languages—the EQUALS experience, Proceedings of the 1992 ACM conference on LISP and functional programming, p.335-344, June 22-24, 1992, San Francisco, California, United States
|
| |
23
|
KASER, O., RAMAKRISHNAN, C., AND SEKAR, R. 1994. A high performance runtime system for parallel evaluation of lazy languages. In Parallel and Symbolic Computation. World Scientific, River Edge, N.J.
|
| |
24
|
KELLER, R. 1980. Semantics and applications of function graphs. Tech. Rep. UUCS-80-112, Univ. of Utah, Salt Lake City, Utah.
|
 |
25
|
|
| |
26
|
|
| |
27
|
|
 |
28
|
|
| |
29
|
|
 |
30
|
|
| |
31
|
|
 |
32
|
|
 |
33
|
C. R. Ramakrishnan , I. V. Ramakrishnan , R. C. Sekar, A symbolic constraint solving framework for analysis of logic programs, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.12-23, June 21-23, 1995, La Jolla, California, United States
[doi> 10.1145/215465.215467]
|
| |
34
|
|
| |
35
|
|
 |
36
|
R. C. Sekar , Prateek Mishra , I. V. Ramakrishnan, On the power and limitation of strictness analysis based on abstract interpretation, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.37-48, January 21-23, 1991, Orlando, Florida, United States
[doi> 10.1145/99583.99591]
|
 |
37
|
|
| |
38
|
|
| |
39
|
WADLER, P. 1987. Strictness analysis on non-fiat domains (by abstract interpretation over finite domains). In Abstract Interpretation of Declarative Languages, S. Abramsky and C. Hankin Eds. Ellis Horwood, Chichester, U.K., 266-275.
|
|