Type and E ect Systems - Correct System Design: Recent Insights and Advances - page 129

Acknowledgements. We wish to thank Torben Amtoft for working with us for
many years on type and eect systems; we would also like to thank the referees
for their careful reading and helpful comments.

References

1. T. Amtoft, F. Nielson, and H. R. Nielson. Type and Eect Systems: Behaviours
for Concurrency . Imperial College Press, 1999.
2. T. Amtoft, F. Nielson, and H.R. Nielson. Type and behaviour reconstruction for
higher-order concurrent programs. Journal of Functional Programming , 7(3):321{

347, 1997.
3. T. Amtoft, F. Nielson, H.R. Nielson, and J. Ammann. Polymorphic subtyping for
eect analysis: The dynamic semantics. In Analysis and Verication of Multiple-
Agent Languages , volume 1192 of Lecture Notes in Computer Science , pages 172{
206. Springer, 1997.
4. P. N. Benton. Strictness logic and polymorphic invariance. In Proc. Second Inter-
national Symposium on Logical Foundations of Computer Science , volume 620 of
Lecture Notes in Computer Science , pages 33{44. Springer, 1992.
5. P. N. Benton. Strictness properties of lazy algebraic datatypes. In Proc. WSA '93 ,
volume 724 of Lecture Notes in Computer Science , pages 206{217. Springer, 1993.
6. L. Damas and R. Milner. Principal type-schemes for functional programs. In

Proc. POPL '82 , pages 207{212. ACM Press, 1982.
7. K.-F. Faxen. Optimizing lazy functional programs using flow inference. In
Proc. SAS '95 , volume 983 of Lecture Notes in Computer Science , pages 136{153.
Springer, 1995.
8. K.-F. Faxen. Polyvariance, polymorphism, and flow analysis. In Proc. Analysis
and Verication of Multiple-Agent Languages , volume 1192 of

Lecture Notes in

Computer Science , pages 260{278. Springer, 1997.
9. Y.-C. Fuh and P. Mishra. Polymorphic subtype inference: Closing the theory-
practice gap. In Proc. TAPSOFT '89 , volume 352 of Lecture Notes in Computer
Science , pages 167{183. Springer, 1989.
10. Y.-C. Fuh and P. Mishra. Type inference with subtypes.

Theoretical Computer

Science , 73:155{175, 1990.
11. N. Heintze. Control-flow analysis and type systems. In Proc. SAS '95 , volume 983
of Lecture Notes in Computer Science , pages 189{206. Springer, 1995.
12. Nevin Heintze and Jon G. Riecke. The SLam calculus: Programming with Secrecy
and Integrity. In Proc. POPL '98 , pages 365{377. ACM Press, 1998.
13. F. Henglein and C. Mossin. Polymorphic binding-time analysis. In Proc. ESOP
'94 , volume 788 of Lecture Notes in Computer Science , pages 287{301. Springer,
1994.
14. T. P. Jensen. Strictness analysis in logical form. In Proc. FPCA '91 , volume 523
of Lecture Notes in Computer Science , pages 352{366. Springer, 1991.
15. T. P. Jensen. Disjunctive strictness analysis. In Proc. LICS '92 , pages 174{185,
1992.
16. M. P. Jones. A theory of qualied types. In Proc. ESOP '92 , volume 582 of Lecture
Notes in Computer Science , pages 287{306. Springer, 1992.
17. N. D. Jones and F. Nielson. Abstract Interpretation: a Semantics-Based Tool for
Program Analysis. In Handbook of Logic in Computer Science volume 4 .Oxford
University Press, 1995.