|
 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
|
[Burn et al 85] G. L. Burn, C. L. Hankin & S. Abramsky, The Theory and Practice of Strictness Analysis of Higher Order Functions, Department of Computing, Imperial College London, Research Report Doc 85/6, April 1985.
|
| |
2
|
[Coquand & Huet 85] Thierry Coquand & Gérard Huet, Constructions: A Higher Order Proof System for Mechanising Mathematics, INRIA Rapport de Recherche Number 401, 1985. Also appears in Springer LNCS 203.
|
| |
3
|
[Elworthy 85] David Elworthy, Implementing a Ponder Cross-compiler for the SKIM processor, Cambridge University Computer Laboratory, Diploma Dissertation 1985.
|
| |
4
|
[Fairbairn 83] Jon Fairbairn, Ponder and its Type System, University of Cambridge Computer Laboratory, Technical Report No. 31, 1983.
|
| |
5
|
[Fairbairn 85] Jan Fairbairn, Design and Implementation of a Simple Typed Language Based on the Lambda-Calculue, University of Cambridge Computer Laboratory, Technical Report No. 75, May 1985.
|
 |
6
|
|
| |
7
|
[Hudak & Goldberg 85] Paul Hudak & Benjamin Goldberg, Serial Combinators: "Optimal" Grains of Parallelism, Yale University, Department of Computer Science, 1985.
|
| |
8
|
|
| |
9
|
[Hudak & Young 85] Paul Hudak & Jonathan Young, A Set-Theoretic Characterization of Function Strictness in the Lambda Calculus, Yale University, Department of Computer Science, Research Report YALEU/DCS/RR-391 (April 1985).
|
| |
10
|
[Hughes 82] John Hughes, Graph Reduction with Super-Combinators, Oxford University Programming Research Group, Technical Monograph PRG-28 (1982).
|
| |
11
|
[Hughes 85] John Hughes, Short talk at Workshop on Functional Programming, Aspenäs, Sweden, February 1985.
|
| |
12
|
[Johnsson 83] Thomas Johnsson, The G-Machine: An Abstract Machine for Graph Reduction. Proceedings of SERC Declarative Programming Workshop at UCL, April 1983.
|
| |
13
|
[Kieburtz & Napierala 85] Richard B. Kieburtz & Maria Napierala, A studied laziness-strictness analysis with structured data types, Oregon Graduate Centre, Extended Abstract, July 1985.
|
| |
14
|
[Mandelbrot 83] Benoit B. Mandelbrot, The fractal geometry of nature, W. H. Freeman, New York 1983.
|
| |
15
|
[Milner 78] Robin Milner, A Theory of Type Polymorphism in Programming, Journal of Computer and System Sciences Vol. 17 Number 3, December 1978.
|
| |
16
|
[Mycroft 81] Alan Mycroft, Abstract Interpretation and Optimising Transformations for Applicative Programs, PhD Thesis, University of Edinburgh, December 1981.
|
| |
17
|
W. R. Stoye , T. J. W. Clarke , A. C. Norman, Some practical methods for rapid combinator reduction, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.159-166, August 06-08, 1984, Austin, Texas, United States
[doi> 10.1145/800055.802032]
|
| |
18
|
[Tillotson 85] Mark Tillotson, Introduction to the Functional Programming Language "Ponder", University of Cambridge Computer Laboratory, Technical Report No. 65, May 1985.
|
| |
19
|
[Wadler 85] Phil Wadler, Strictness Analysis on Non-Flat Domains, Programming Research Group, Oxford University, November 1985.
|
| |
20
|
[Wray 86] S. C. Wray, Implementation and Programming Techniques for Functional Languages, Submitted as PhD Thesis, University of Cambridge, January 1986.
|
CITED BY 7
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
G. L. Burn , S. L. Peyton Jones , J. D. Robson, The spineless G-machine, Proceedings of the 1988 ACM conference on LISP and functional programming, p.244-258, July 25-27, 1988, Snowbird, Utah, United States
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf