A. Banerjee. A modular, polyvariant, and type-based closure analysis. In International Conference on Functional Programming. ACM Press, 1997. To Appear.
H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 1983.
N. Benton. Strictness Analysis of Lazy Functional Programs. PhD thesis, University of Cambridge, December 1992.
M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Functional characters of solvable terms. Zeitschrift für Mathematische Logik and Grundlagen der Mathematik
, 27:45–58, 1981.Google Scholar
D. Dussart, F. Henglein, and C. Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In Proc. 2nd Int'l Static Analysis Symposium (SAS), volume 983 of LNCS, pages 118–135, 1995.
K.-F. Faxen. Analysing, Transforming and Compiling Lazy Functional Programs. PhD thesis, Royal Institute of Technology, Sweden, 1997.
C. Gomard. Higher order partial evaluation-hope for the lambda calculus. Master's thesis, DIKU, University of Copenhagen, Denmark, September 1989.Google Scholar
N. Heintze. Control-flow analysis and type systems. In Symposium on Static Analysis (SAS), volume 983 of LNCS, pages 189–206, Glasgow, 1995.
N. Heintze and D. McAllester. Linear-time subtransitive control flow analysis. In Programming Language Design and Implementation (PLDI), 1997.
F. Henglein. Dynamic typing: Syntax and proof theory. Science of Computer Programming (SCP), 22(3):197–230, 1994.Google Scholar
F. Henglein and J. Jørgensen. Formally optimal boxing. In Proc. 21st ACM Symp. on Principles of Programming Languages (POPL), Portland, Oregon. ACM, 1994.
F. Henglein and C. Mossin. Polymorphic binding-time analysis. In D. Sannella, editor, Proceedings of European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 287–301. Springer-Verlag, Apr. 1994.
S. Jaganathan and S. Weeks. A unified treatment of flow analysis in higher-order languages. In POPL'95, pages 393-407. ACM Press, 1995.
T. Jensen. Abstract Interpretation in Logical Form. PhD thesis, Imperial College, Univ. of London, November 1992. Available as DIKU Report 93/11.
J. Jørgensen. A Calculus for Boxing Analysis of Polymorphically Typed Languages. PhD thesis, DIKU, University of Copenhagen, October 1995.
T. Kuo and P. Mishra. On strictness and its analysis. In Proc. 14th Annual ACM Symposium on Principles of Programming Languages, pages 144–155, Jan. 1987.
T. Kuo and P. Mishra. Strictness analysis: A new perspective based on type inference. In Proc. Functional Programming Languages and Computer Architecture (FPCA), London, England, pages 260–272. ACM Press, Sept. 1989.
X. Leroy. Unboxed objects and polymorphic typing. In Proc. 19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programmin gLanguages (POPL), Albuquerque, New Mexico, pages 177–188. ACM Press, Jan. 1992.
J. M. Lucassen and D. K. Gifford. Polymorphic effect systems. In Principles of Programming Languages (POPL). ACM, 1988.
C. Mossin. Exact flow analysis. Technical report, DIKU, 1997.
C. Mossin. Flow Analysis of Typed Higher-Order Programs. PhD thesis, DIKU, University of Copenhagen, January 1997.
F. Nielson and H. R. Nielson. Infinitary control flow analysis: a collecting semantics for closure analysis. In 24th Symposium on Principles of Programming Languages, pages 332–345, 1997.
H. R. Nielson and F. Nielson. Automatic binding time analysis for a typed lambda-calculus. In Fifteenth ACM Symposium on Principles of Programming Languages, pages 98–106. ACM Press, January 1988. Extended Abstract.
J. Palsberg. Global program analysis in constraint form. In 19th International Colloquium on Trees in Algebra and Programming (CAAP'94), volume 787 of LNCS, pages 276–290, 1994.
J. Palsberg and P. O'Keefe. A type system equivalent to flow analysis. In Principles of Programming Languages, 1995.
P. Sestoft. Analysis and Efficient Implementation of Functional Languages. PhD thesis, DIKU, University of Copenhagen, Oct. 1991.
O. Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie Mellon University, May 1991. CMU-CS-91-145.
K. L. Solberg. Strictness and totality analysis. In Symposium on Static Analysis, pages 408–422, 1994.
K. L. Solberg. Strictness and totality analysis with conjunction. In TAPSOFT, pages 501–515, 1995.
R. Statman. The typed λ-calculus is not elementary recursive. Theoretical Computer Science
, 9(1):73–81, Juli 1979.Google Scholar
J.-P. Talpin and P. Jouvelot. The type and effect discipline. Information and Computation
, 111:245–296, 1994.Google Scholar
D. Wright. A new technique for strictness analysis. In Proc. Int'l J. Conf. on Theory and Practice of Software Development (TAPSOFT), April 1991.