A modular, polyvariant, and type-based closure analysis

by Anindya Banerjee
Venue:In ICFP ’97 [ICFP97
Citations:54 - 1 self

Documents Related by Co-Citation

93 What Are Principal Typings and What Are They Good For? – Trevor Jim - 1995
46 Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems – Stephanus Johannes Van Bakel, Prof M. Dezani-ciancaglini, Voor Mijn Moeder Manuscriptcommissie, Della Rocca - 1993
47 Control-Flow Analysis and Type Systems – Nevin Heintze - 1995
187 Soft typing with conditional types – Er Aiken - 1994
16 Inference of Polymorphic and Conditional Strictness Properties – Thomas P. Jensen - 1998
51 Principality and Decidable Type Inference for Finite-Rank Intersection Types – A. J. Kfoury, J. B. Wells - 1999
935 A theory of type polymorphism in programming – Robin Milner - 1978
85 Polymorphic Type Inference – D Leivant - 1983
27 A complete type inference algorithm for simple intersection types – M Coppo, P Giannini - 1992
233 Principal type schemes for functional programs – L Damas, R Milner - 1982
29 Principal type scheme and unification for intersection type discipline – S Ronchi Della Rocca - 1988
58 Principal type schemes for an extended type theory – Ronchi della Rocca, S, B Venneri - 1984
29 Strongly Typed Flow-Directed Representation Transformations (Extended Abstract) – Allyn Dimock, Robert Muller, Franklyn Turbak, J. B. Wells - 1997
76 Lightweight Closure Conversion – Paul A. Steckler, Mitchell Wand - 1996
16 Type reconstruction in Fω – P Urzyczyn - 1997
620 Compiling with Continuations – Andrew W Appel - 1992
304 Subtyping recursive types – Roberto M. Amadio, Luca Cardelli - 1993
215 Type Inclusion Constraints and Type Inference – Alexander Aiken, Edward L. Wimmers - 1993
41 Linear-time Subtransitive Control Flow Analysis – Nevin Heintze, David Mcallester - 1997