|
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
|
|
| |
6
|
Eekelen M.C.J.D. van, E. Goubault, C. Hankin and E. N'dcker, Abstract Reduction: Towards a Theory via Abstract Interpreration, in: Proc. of Semagraph Symposium, Nijmegen, The Netherlands, 1991, also to appear in Sleep et al. {1993}.
|
| |
7
|
Goubault E. and C. Hankin, A Lattice for the Abstract Interpreration of Term Graph Rewrite Systems, in: Proc. of Semagraph Symposium, pages 263--273, Nijmegen, The Netherlands, 1991, also to appear in Sleep et al. {1993}.
|
 |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
Mycroft A., Abstract interpretation and opiimising transformations for applicative programs, PhD thesis, University of Edinburgh, 1981.
|
| |
12
|
N'~cker E., Strictness Analysis by Abstract Reduction in Orthogonal Term Rewriting Systems, Technical Report 92-31, University of Nijmegen, 1992.
|
| |
13
|
|
| |
14
|
Plasmeijer M.J., M.C.J.D. van Eekelen, E. NScker and J.E.W. Smetsers, The Concurrent Clean System- Functional Programming on the Macintosh, in: Proc. of 7$h int. Conference of the Apple European Univerzit~t Consortium, Paris, 1991.
|
| |
15
|
|
| |
16
|
Toyama Y., J.E.W. Smetsers, M.C.J.D. van Eekelen and M.J. Plasmeijer, The Functional Strategy and T~ansitive Term Rewriting Systems, in: Proc. of Semagraph Symposium, pages 99-115, Nijmegen, The Netherlands, 1991, also to appear in Sleep et aL {1993}.
|
| |
17
|
|
| |
18
|
Wadler P., Strictness Analysis over Non-fiat Domains, in: Abstract interpretation of Declarative Languages, Ellis Horwood, 1987.
|
|