论文信息 - Bottom-Up -Substitution: Uplinks and -DAGs - 字舞流文

Bottom-Up -Substitution: Uplinks and -DAGs

Mitchell Wand | Olin Shivers | O. Shivers | M. Wand

[1] Peter Lee,et al. TIL: a type-directed, optimizing compiler for ML , 2004, SIGP.

[2] Zhong Shao,et al. Implementing typed intermediate languages , 1998, ICFP '98.

[3] Gopalan Nadathur,et al. A Notation for Lambda Terms: A Generalization of Environments , 1998, Theor. Comput. Sci..

[4] Andrea Asperti,et al. The optimal implementation of functional programming languages , 1998, Cambridge tracts in theoretical computer science.

[5] David B. MacQueen,et al. The Definition of Standard ML (Revised) , 1997 .

[6] Andrew W. Appel,et al. A type-based compiler for standard ML , 1995, PLDI '95.

[7] Richard Kelsey,et al. A correspondence between continuation passing style and static single assignment form , 1995, IR '95.

[8] Martín Abadi,et al. The geometry of optimal lambda reduction , 1992, POPL '92.

[9] John Lamping. An algorithm for optimal lambda calculus reduction , 1989, POPL '90.

[10] Richard Kennaway,et al. Director strings as combinators , 1988, TOPL.

[11] Harold T. Hodes,et al. The | lambda-Calculus. , 1988 .

[12] Simon L. Peyton Jones,et al. The Implementation of Functional Programming Languages , 1987 .

[13] A. Church. The calculi of lambda-conversion , 1941 .