Polymorphic subtyping for effect analysis: The static semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1192 LNCS, Issue , 1997, Pages 141-171

  Nielson, Hanne Riis ^a   Nielson, Flemming ^a   Amtoft, Torben ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONSERVATIVE EXTENSIONS; EFFECT ANALYSIS; INFERENCE ALGORITHM; STATIC SEMANTICS; SUBTYPINGS; TYPE AND EFFECT SYSTEMS; TYPE SYSTEMS;

INFERENCE ENGINES;

SEMANTICS;

EID: 84878649836     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62503-8_8     Document Type: Conference Paper

References (24)

1. T. Amtoft, F. Nielson, H.R. Nielson: Type and behaviour reconstruction for higher-order concurrent programs. To appear in Journal of Functional Programming, 1997.
2. T. Amtoft, F. Nielson, H.R. Nielson, J. Ammann: Polymorphic subtypes for effect analysis: the dynamic semantics. This volume of SLNCS, 1997.
3. L. Damas and R. Milner: Principal type-schemes for functional programs. In Proc. of POPL '82. ACM Press, 1982.
4. Y.-C. Fuh and P. Mishra: Polymorphic subtype inference: closing the theory-practice gap. In Proc. TAPSOFT '89. SLNCS 352, 1989.
5. Y.-C. Fuh and P. Mishra: Type inference with subtypes. Theoretical Computer Science, 73, 1990.
6. F. Henglein: Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2)-.253-289, 1993. (Pubitemid 23640115)
7. F. Henglein and C. Mossin: Polymorphic binding-time analysis. In Proc. ESOP '94, pages 287-301. SLNCS 788, 1994.
8. M.P. Jones: A theory of qualified types. In Proc. ESOP '92, pages 287-306. SLNCS 582, 1992.
9. X. Leroy and P. Weis: Polymorphic type inference and assignment. In Proc. POPL '91, pages 291-302. ACM Press, 1991.
10. R. Milner: A theory of type polymorphism in programming. Journal of Computer Systems, 17:348-375, 1978.
11. J.C. Mitchell: Type inference with simple subtypes. Journal of Functional Programming, 1(3), 1991.
12. F. Nielson and H.R. Nielson: Constraints for polymorphic behaviours for Concurrent ML. In Proc. CCL'94. SLNCS 845, 1994.
13. F. Nielson, H.R. Nielson, T. Amtoft: Polymorphic subtypes for effect analysis: the algorithm. This volume of SLNCS, 1997.
14. H.R. Nielson and F. Nielson: Automatic binding analysis for a typed A-calculus. Science of Computer Programming, 10:139-176, 1988. (Pubitemid 18606162)
15. H.R. Nielson and F. Nielson: Higher-order concurrent programs with finite communication topology. In Proc. POPL'94, pages 84-97. ACM Press, 1994.
16. P. Panangaden and J.H. Reppy: The essence of Concurrent ML. In ML with Concurrency: Design, Analysis, Implementation and Application (editor: Flemming Nielson), Springer-Verlag, 1996.
17. J.H. Reppy: Concurrent ML: Design, application and semantics. In Proc. Functional Programming, Concurrency, Simulation and Automated Reasoning, pages 165-198. SLNCS 693, 1993.
18. G.S. Smith: Polymorphic inference with overloading and subtyping. In SLNCS 668, Proc. TAPSOFT '93, 1993.
19. Also see: Principal Type Schemes for Functional Programs with Overloading and Subtyping: Science of Computer Programming 23, pp. 197-226, 1994.
20. J.P. Talpin and P. Jouvelot: The type and effect discipline. Information and Computation, 111, 1994.
21. Y.-M. Tang: Control flow analysis by effect systems and abstract interpretation. PhD thesis, Ecoles des Mines de Paris, 1994.
22. M. Tofte. Type inference for polymorphic references. Information and Computation, 89:1-34, 1990.
23. M. Tofte and L. Birkedal: Region-annotated types and type schemes, 1996. Submitted for publication.
24. A.K. Wright: Typing references by effect inference. In Proc. ESOP '92, pages 473-491. SLNCS 582, 1992.