Student Presentations
Every student will give a 45-minute presentation of a relevant article during
the course. The following times have been allocated for presentations:
- Week 8, Monday at 14:15. Jörgen Gustavsson. Strictness
Analysis: A New Perspective Based on Type Inference, T-M. Kuo,
P. Mishra, FPCA 1989; plus Strictness Analysis in Logical Form,
T. Jensen, FPCA 1991.
- Week 10, Monday at 13:15. Lars Pareto. Implementation of the Typed Call-by-value lambda-calculus using a
Stack of Regions, Mads Tofte and Jean-Pierre Talpin, POPL 1994.
- Week 10, Monday at 14:15. Johan Agat. Binding Time Analysis: A New PERspective, S Hunt and D Sands, PEPM 91.
- Week 11, Monday at 14:15. Bengt Johansson. Projections for strictness analysis, Philip Wadler and R.J.M. Hughes. FPCA 1987. And Compile-time Analysis of Functional Programs, John Hughes, in Research Topics in Functional Programming, ed. David Turner, 1989?.
- Week 13, Monday at 13:15. Henrik Persson. Flow Analysis in the Geometry of Interaction.Thomas Jensen and Ian Mackie. To appear in
proceedings ESOP'96.
- Week 13, Monday at 14:15. Ove Nilsson. Type-Directed
Partial Evaluation, Olivier Danvy, POPL 96.
- Week 13, Friday at 13:15. Rogardt Heldal. One of Efficient Type
Inference for Higher-Order Binding-Time Analysis, F Henglein,
(FPCA 1991); Polymorphic
Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis
in Polynomial Time, D Dussart, F Henglein, and C Mossin, SAS
1995.
- Week 13, Friday at 14:15. Andy Moran. Path Analysis and the
Optimization of Nonstrict Functional Programs, Adrienne Bloss, ACM
Toplas Vol 16 No 3, May 1994.
- Week 16, Monday at 13:15. Ilya Beylin. On the generation of specializers. R
Glück. Journal of Functional Programming 4(4), pp. 499-514. 1994.
Suggested Articles
The following other articles would complement the material in the lectures well.
- Abstract
Interpretation: a Unified Lattice Model for Static Analysis of Programs
by Construction or Approximation of Fixpoints, Patrick and Radhia
Cousot, POPL 1977.
- Strictness analysis on non-flat domains (by abstract interpretation over finite domains), Higher-order abstract interpretation (and application to
comportment analysis generalizing strictness, termination, projection and PER analysis of
functional languages), Patrick Cousot and Radhia Cousot, invited paper. In Proceedings of the 1994 International Conference on
Computer Languages, ICCL'94, Toulouse, France, pages 95--112. IEEE Computer Society
Press, Los Alamitos, California, U.S.A., May 16--19, 1994.
- The
Abstract Interpretation of Higher-Order Functional Languages: From
Properties to Abstract Domains, G.L. Burn, In R. Heldal,
C. Holst Kehler, and P. Wadler, editors, Glasgow functional programming
workshop, pages 56--72, Aug 91.
-
A type-based framework for program analysis, C. L. Hankin and
D. Le Metayer, SAS94, Springer LNCS.
Alternatively you can find many relevant articles in:
- The Journal of Functional
Programming.
- ACM Lisp and Functional Programming.
- ACM Partial Evaluation and Program Manipulation.
- ACM Principles of Programming Languages.
- ACM Functional Programming Languages and Computer Architecture.
- European Symposium on Programming, normally published by Springer
LNCS.
- Static Analysis Symposium (formerly the Workshop on Static Analysis),
normally published by Springer LNCS.
- The Dagstuhl
Workshop on Partial Evaluation.
Last modified: Mon Mar 25 10:15:06 MET 1996