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

18. P. Jouvelot. Semantic Parallelization: a practical exercise in abstract interpreta-
tion. In Proc. POPL '87 , pages 39{48, 1987.
19. P. Jouvelot and D. K. Giord. Reasoning about continuations with control eects.
In Proc. PLDI '89 , ACM SIGPLAN Notices, pages 218{226. ACM Press, 1989.
20. P. Jouvelot and D. K. Giord. Algebraic reconstruction of types and eects. In
Proc. POPL '91 , pages 303{310. ACM Press, 1990.
21. J. M. Lucassen and D. K. Giord. Polymorphic eect analysis. In Proc. POPL
'88 , pages 47{57. ACM Press, 1988.
22. R. Milner. A theory of type polymorphism in programming. Journal of Computer
Systems , 17:348{375, 1978.
23. J. Mitchell. Type inference with simple subtypes. Journal of Functional Program-
ming , 1(3):245{285, 1991.
24. F. Nielson. A formal type system for comparing partial evaluators. In D. Bjrner,
A. P. Ershov, and N. D. Jones, editors, Proc. Partial Evaluation and Mixed Com-
putation , pages 349{384. North Holland, 1988.
25. F. Nielson. The typed -calculus with rst-class processes. In Proc. PARLE'89 ,

volume 366 of Lecture Notes in Computer Science , pages 355{373. Springer, 1989.
26. F. Nielson and H. R. Nielson. Two-Level Functional Languages ,volume34of
Cambridge Tracts in Theoretical Computer Science . Cambridge University Press,
1992.
27. F. Nielson and H. R. Nielson. From CML to process algebras. In Proc. CON-
CUR'93 , volume 715 of Lecture Notes in Computer Science , pages 493{508.

Springer, 1993.
28. F. Nielson and H. R. Nielson. Layered predicates. In Proc. REX'92 workshop
on Semantics | foundations and applications , volume 666 of Lecture Notes in

Computer Science , pages 425{456. Springer, 1993.
29. F. Nielson and H. R. Nielson.

From CML to its process algebra. Theoretical

Computer Science , 155:179{219, 1996.
30. F. Nielson, H. R. Nielson, and C. L. Hankin. Principles of Program Analysis .

Springer, 1999.
31. F. Nielson, H.R. Nielson, and T. Amtoft. Polymorphic subtyping for eect analysis:
The algorithm. In Analysis and Verication of Multiple-Agent Languages ,volume
1192 of Lecture Notes in Computer Science , pages 207{243. Springer, 1997.
32. H. R. Nielson, T. Amtoft, and F. Nielson. Behaviour analysis and safety condi-
tions: a case study in CML. In Proc. FASE '98 , number 1382 in Lecture Notes in
Computer Science, pages 255{269. Springer, 1998.
33. H. R. Nielson and F. Nielson. Higher-Order Concurrent Programs with Finite
Communication Topology. In Proc. POPL '94 . Springer, 1994.
34. H. R. Nielson and F. Nielson. Communication analysis for Concurrent ML. In
F. Nielson, editor, ML with Concurrency , Monographs in Computer Science, pages
185{235. Springer, 1997.
35. H.R. Nielson, F. Nielson, and T. Amtoft. Polymorphic subtyping for eect analysis:
The static semantics. In Analysis and Verication of Multiple-Agent Languages ,
volume 1192 of Lecture Notes in Computer Science , pages 141{171. Springer, 1997.
36. G. D. Plotkin. A structural approach to operational semantics. Technical Report
FN-19, DAIMI, Aarhus University, Denmark, 1981.
37. G. S. Smith. Polymorphic inference with overloading and subtyping. In Proc. TAP-
SOFT '93 , volume 668 of Lecture Notes in Computer Science , pages 671{685.

Springer, 1993.
38. G. S. Smith. Polymorphic type schemes for functional programs with overloading
and subtyping. Science of Computer Programming , 23:197{226, 1994.