Detecting sharing of partial applications in functional programs
暂无分享,去创建一个
[1] Paul Hudak,et al. Higher-order strictness analysis in untyped lambda calculus , 1986, POPL '86.
[2] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .
[3] Benjamin Goldberg. Buckwheat: graph reduction on a shared-memory multiprocessor , 1988, LFP '88.
[4] D. A. Turner,et al. A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..
[5] Simon L. Peyton Jones,et al. Strictness Analysis - A Practical Approach , 1985, FPCA.
[6] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[7] Benjamin Goldberg. Generational reference counting: a reduced-communication distributed storage reclamation scheme , 1989, PLDI '89.
[8] Chris Hankin,et al. The theory of strictness analysis for higher order functions , 1985, Programs as Data Objects.
[9] R. J. M. Hughes,et al. Super-combinators a new implementation method for applicative languages , 1982, LFP '82.
[10] Alan Mycroft,et al. Abstract interpretation and optimising transformations for applicative programs , 1982 .
[11] Benjamin Goldberg. A reduced-communication storage reclamation scheme for distributed memory multiprocessors , 1989 .
[12] Paul Hudak,et al. Variations on strictness analysis , 1986, LFP '86.
[13] M. Schönfinkel. Über die Bausteine der mathematischen Logik , 1924 .