Xavier Leroy
Pierre Weis
- 1.A. W. Appei and D. B. MacQueen. Standard ML reference manual (preliminary). AT&T Bell Laboratories, 1989.Google Scholar
- 2.L. Cardelli. TypefuI programming. Research report 45~ DEC Systems Research Center, 1989.Google Scholar
- 3.G. Cousineau and G. ttuet. The CAML primer. Technical report 122, INRIA, 1990.Google Scholar
- 4.L. Damas. Type assignment in programming languages. PhD thesis, University of Edinburgh, 1985.Google Scholar
- 5.L. Damas and R. Milner. Principal type-schemas for functional programs. In Proc. Syrup. Principles of Programming Languages, 1982. Google ScholarDigital Library
- 6.Y.-C. Fuh and P. Mishra. Type inference with subtypes. In ESOP '88, volume 300 of Lecture Notes in Computer Science, pages 94-114. Springer Verlag, 1988. Google ScholarCross Ref
- 7.J.-Y. Girard. Interprdtation fonctionnelle et ~- limination des coupures de l'arithmgtique d'ordre sup~rieur. Th~se d'Etat, Universit~ Paris VII, 1972.Google Scholar
- 8.M. J. Gordon, A. J. Milner, and C. P. Wadsworth. Edinburgh L CF, volume 78 of Lecture Notes in Computer Science. Springer-Verlag, 1979.Google Scholar
- 9.J. M. Lucassen and D. K. Gifford. Polymorphic effect systems, in Proc. Symp. Principles of Programming Languages, 1988. Google ScholarDigital Library
- 10.R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes" part 1. Research report ECS- LFCS-89-85, University of Edinburgh, 1989.Google Scholar
- 11.R. Milner, M. Torte, and R. Harper. The definition of Standard ML. The MIT Press, 1990. Google ScholarDigital Library
- 12.J. C. Mitchell. Coercion and type inference. In Proc. Symp. Principles of Programming Languages, 1984. Google ScholarDigital Library
- 13.J. H. Reppy. First-class synchronous operations in Standard ML. Technical Report TR 89-1068, Cornell University, 1989. Google ScholarDigital Library
- 14.3. C. Reynolds. Toward a theory of type structure. In Colloquium on Programming, volume 19 of Lecture Notes in Computer Science. Springer-Verlag, 1974. Google ScholarDigital Library
- 15.G. Smolka. FRESH: a higher-order language with unification and multiple results. In Logic Programming: Functions, Relations, and Equations. Prentice-Hall, 1986.Google Scholar
- 16.M. Torte. Operational semantics and polymorphic type inference. PhD thesis, University of Edinburgh, 1987.Google Scholar
- 17.M. Torte. Type inference for polymorphic references. To appear in Information and Computation, 1990. Google ScholarDigital Library
Index Terms
- Polymorphic type inference and assignment
Recommendations
Polymorphic type inference
POPL '83: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languagesThe benefits of strong typing to disciplined programming, to compile-time error detection and to program verification are well known. Strong typing is especially natural for functional (applicative) languages, in which function application is the central ...
Comments