REFERENCES
[1] F. Damiani: " Redundant-code detection and elimination for PCF with
algebraic Datatypes." Proc. of TLCA '99, Lecture Notes
in Computer Science n. , Sringer Verlag.
[2] F. Damiani, P. Giannini: " Automatic dead-code detection
and elimination for HOT functional programs. " to appear in J. Funct.
Prog..
[3] M. Coppo, F. Damiani, P. Giannini: "Strictness, totality,
and non-standard type inference." to appear in Theoret. Comp. Sci..
[4] F.Damiani. "Typing local definitions and conditional expressions
with rank 2 intersection." Internal report, Dipartimento di Informatica,
University of Turin, 1999.
[5] S. Drossopoulou, M. Dezani-Ciancaglini, F. Damiani, P. Giannini.
"Objects dynamically changing class". Internal report, Dipartimento
di Informatica, University of Turin, 1999.
[6] C. Berline, S. Berardi: " Beta-eta-complete models for System
F" Internal Report, Univesity of Turin, 1998 (submitted for pubblication
to M. F. C. S.).
[7] C. Berline, S. Berardi: " Webbed models for System F " internal
Report, Univesity of Turin, 1998 .
[8] S. Berardi, T. Coquand " Transfinite Games" submitted to JSL.
Next: University of Udine
Up: Progress Report
Previous: The Universities of Stockholm and Uppsala