Type Inference with Polymorphic Recursion

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 15, Issue 2, 1993, Pages 253-289

  Henglein, Fritz ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

polymorphism; recursion; semiunification; type inference

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; INFERENCE ENGINES; LOGIC PROGRAMMING; MATHEMATICAL TECHNIQUES; RECURSIVE FUNCTIONS;

DAMAS MILNER CALCULUS; LAMBDA CALCULUS; MILNER MYCROFT CALCULUS; MILNER'S SEMANTICS; POLYMORPHIC RECURSION; SEMIUNIFICATION ALGORITHM; TYPE INFERENCE;

COMPUTATION THEORY;

EID: 0027579091     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/169701.169692     Document Type: Article

References (66)

1. AHO, A., SETHI, R., AND ULLMAN, J. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass., 1986. Addison-Wesley, 1986, Reprinted with corrections, March 1988.
2. BARENDREGT, H. The Lambda calculus: Its syntax and semantics. In Studies in Logic and the Foundations of Mathematics, vol 103. North-Holland, Amsterdam, 1984.
3. BEN-YELLES, C. Type-assignment in the Lambda-calculus. Ph.D. dissertation, University College, Swansea, UK, 1979.
4. BOEHM, H. Type inference in the presence of type abstraction. In Proceedings of the SIGPLAN ′89 Conference on Programming Language Design and Implementation (June 1989), ACM, ACM Press, New York, 1989, 192-206.
5. BURSTALL, R., MACQUEEN, D., AND SANNELLA, D. Hope: An experimental applicative language. In Stanford LISP Conference 1980 (1980), 136-143.
6. CARDELLI, L. A semantics of multiple inheritance. Inf. Comput. (Inf. Control), 76 (1988), 138-164.
7. CARDELLI, L., AND WEGNER, P. On understanding types, data abstraction and polymorphism. ACM Comput. Surv. 17, 4 (Dec. 1985), 471-522.
8. CHOU, C. Relaxation processes: Theory, case studies and applications. Master's thesis, UCLA, Feb. 1986. Tech. Rep. CSD-860057.
9. CLEMENT, D., DESPEYROUX, J., DESPEYROUX, T., AND KAHN, G. A simple applicative language: Mini-ML. INRIA Centre, Sophia Antipolis, RR No. 529, May 1986.
10. CURRY, H. Modified basic functionality in combinatory logic. Dialectica 23 (1969), 83-92.
11. CURRY, H., AND FEYS, R. Combinatory Logic. Vol. I, North-Holland, Amsterdam, 1958.
12. CURRY, H., HINDLEY, J., AND SELDIN, J. Combinatory Logic. Vol. II, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1972.
13. DAMAS, L. Type assignment in programming languages. Ph.D. dissertation, Univ. of Edinburgh, 1984.
14. DAMAS, L., AND MILNER, R. Principal type schemes for functional programs. In Proceedings of the 9th Annual ACM Symposium on Principles of Programming Languages (Jan. 1982), 207-212.
15. DöRRE, J., AND ROUNDS, W. On subsumption and semiunification in feature algebras. In Proceedings of the 1990 IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, 1990, 300-311.
16. DWORK, C., KANELLAKIS, P., AND MITCHELL, J. On the sequential nature of unification. J. Logic Program. 1 (1984), 35-50.
17. EDER, E. Properties of substitutions and unifications. J. Symb. Comput. 1 (1985), 31-46.
18. GEURTS, L., MEERTENS, L., AND PEMBERTON, S. The ABC Programmer's Handbook. Prentice-Hall, New York, 1990.
19. GIANNINI, P., AND RONCHI DELLA ROCCA, S. Characterization of typings in polymorphic type discipline. In Proceedings of the Symposium on Logic in Computer Science (1988). IEEE Computer Society Press, 1988, 61-70.
20. GIRARD, J. Une extension de l'interpretation de Godel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la theorie des types. In 2nd Scandinavian Logic Symposium (1971), 63-92. In French.
21. GIRARD, J., LAFONT, Y., AND TAYLOR, P. Proofs and Types. Vol. 7, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1989.
22. HENGLEIN, F. Fast left-linear semiunification. In Proceedings of the International Conference on Computing and Information. Lecture Notes of Computer Science, vol. 468, Springer-Verlag, New York, 1990.
23. HENGLEIN, F. Polymorphic type inference and semi-unification. Ph.D. dissertation, Rutgers Univ., April 1989. Available as NYU Tech. Rep. 443, May 1989, from New York University, Courant Institute of Mathematical Sciences, Department of Computer Science.
24. HENGLEIN, F. Type inference and semi-unification. In Proceedings of the ACM Conference on LISP and Functional Programming (LFP) (Snowbird, Utah, July 1988), ACM Press, New York, 1988, 184-197.
25. HENGLEIN, F., AND MAIRSON, H. The complexity of type inference for higher-order typed lambda calculi. In Proceedings of the 18th ACM Symposium on Principles of Programming Languages (POPL) (Orlando, FL, Jan. 1991), ACM Press, New York, 1991, 119-130.
26. HERBRAND, J. Recherches sur la theorie de la demonstration. In Ecrits logiques de Jacques Herbrand, PUF, Paris, 1968. Thèse de Doctorat d'Etat, Université de Paris, 1930. In French.
27. HINDLEY, R. The principal type-scheme of an object in combinatory logic. Trans. Am. Math. Soc. 146 (Dec. 1969), 29-60.
28. HINDLEY, R., AND SELDIN, J. Introduction to Combinators and Calculus. Vol. 1, London Mathematical Society Student Texts, Cambridge University Press, 1986.
29. HOOPER, P. The undecidability of the Turing machine immortality problem. Ph.D. dissertation, Harvard Univ., June 1965. Computation Lab. Rep. BL-38; also in J. Symbolic Logic, 1966.
30. HUDAK, P., AND WADLER, P., EDS. Report on the Programming Language Haskell. Yale Univ., April 1990.
31. HUET, G. Confluent reductions: Abstract properties and applications to term rewriting systems. J. ACM 27, 4 (Oct. 1980), 797-821.
32. HUET, G. Résolution d'equations dans des langages d'ordre 1, 2,…, omega (Thèse de Doctorat d'Etat). Univ. Paris VII, Sept. 1976.
33. JOHNSON, G., AND WALZ, J. A maximum-flow approach to anomaly isolation in unification-based incremental type inference. In Proceedings of the 13th Annual ACM Symposium on Principles of Programming Languages (Jan. 1986), ACM, New York, 1986, 44-57.
34. KANELLAKIS, P., AND MITCHELL, J. Polymorphic unification and ML typing (extended abstract). In Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages (Jan 1989), ACM, New York, 1989.
35. KANELLAKIS, P., MAIRSON, H., AND MITCHELL, J. Unification and ML type reconstruction. In Computational Logic-Essays in Honor of Alan Robinson, J.-L. Lassez and G. Plotkin, Eds. MIT Press, 1991.
36. KAPUR, D., MUSSER, D., NARENDRAN, P., AND STILLMAN, J. Semi-unification. Theor. Comput. Sci. 81, 2 (Apr. 1991), 169-188. Based on paper presented at Conference on Foundations of Software Technology and Theoretical Computer Science (FST-TCS), Dec. 1988.
37. KFOURY, A., AND TIURYN, J. Type reconstruction in finite-rank fragments of the polymorphic S-calculus. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science (LICS) (Philadelphia, June 1990), IEEE Computer Society Press, New York, 1990, 2-11.
38. KFOURY, A., TIURYN, J., AND URZYCZYN, P. A proper extension of ML with an effective type-assignment. In Proceedings of the 15th Annual ACM Symposium on Principles of Programming Languages (Jan. 1988), ACM Press, New York, 58-69.
39. KFOURY, A., TIURYN, J., AND URZYCZYN, P. Computational consequences and partial solutions of a generalized unification problem. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science (LICS) (June 1989).
40. KFOURY, A., TIURYN, J., AND URZYCZYN, P. ML typability is DEXPTIME-complete. In Proceedings of the 15th Colloqium on Trees in Algebra and Programming (CAAP) (Copenhagen, May 1990), Lecture Notes in Computer Science, vol. 431, Springer, New York, 1990, 206-220.
41. KFOURY, A., TIURYN, J., AND URZYCZYN, P. The undecidability of the semi-unification problem. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computation (STOC) (Baltimore, Md., May 1990), ACM, New York, 1990, 468-476.
42. LASSEZ, J., MAHER, M., AND MARRIOTT, K. Unification revisited. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed., Morgan Kauffman, Palo Alto, Calif., 1987.
43. LEIVANT, D. Polymorphic type inference. In Proceedings of the 10th ACM Symposium on Principles of Programming Languages (Jan. 1983), ACM, New York, 1983, 88-98.
44. LEIβ, H. On type inference for object-oriented programming languages. In Proceedings of the 1st Workshop on Computer Science Logic (Oct. 1987), Lecture Notes in Computer Science, vol. 329, Springer, New York, 1987.
45. LEIβ, H. Decidability of semi-unification in two variables. Tech. Rep. INF-2-ASE-9-89, Siemens, Munich, Germany, July 1989.
46. LEIβ, H. Semi-unification and type inference for polymorphic recursion. Tech Rep. INF2-ASE-5-89, Siemens, Munich, Germany, 1989.
47. LEIβ, H., AND HENGLEIN, F. A decidable case of the semi-unification problem. In Proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science (MFCS), (Sept. 1991), Lecture Notes in Computer Science, Springer, New York, 1991.
48. MAIRSON, H. Deciding ML typability is complete for deterministic exponential time. In Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL) (Jan. 1990), ACM, New York, 1990.
49. MARTELLI, A., AND MONTANARI, U. An efficient unification algorithm. ACM Trans. Program. Lang Syst. 4, 2 (Apr. 1982), 258-282.
50. MEERTENS, L. Incremental polymorphic type checking in B la Proceedings of the 10th ACM Symposium on Principles of Programming Languages (POPL). ACM, New York, 1983, 265-275.
51. MILNER, R. A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17 (1978), 348-375.
52. MILNER, R., TOFTE, M., AND HARPER, R. The Definition of Standard ML. MIT Press, 1990.
53. MITCHELL, J. Polymorphic type inference and containment. Inf. Control 76 (1988), 211-249.
54. MITCHELL, J. Type systems for programming languages. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed., North-Holland, Amsterdam, 1990.
55. MITCHELL, J., AND HARPER, R. The essence of ML. In Proceedings of the 15th ACM Symposium on Principles of Programming Languages (POPL) (Jan. 1988), ACM, New York, 1988.
56. MORRIS, J. Lambda-Calculus Models of Programming Languages. Ph.D. dissertation, MIT, 1968.
57. MYCROFT, A. Polymorphic type schemes and recursive definitions. In Proceedings of the 6th International Conference on Programming, LNCS 167 (1984).
58. MYCROFT, A., AND O'KEEFE, R. A polymorphic type system for PROLOG. Artif. Intell. 23 (1984), 295-307.
59. PATERSON, M., AND WEGMAN, W. Linear unification. J. Comput. Syst. Sci. 16 (1978), 158-167.
60. PUDLÁK, P. On a unification problem related to Kreisel's conjecture. Commentationes Math. Univer. Carolinae 29, 3 (1988), 551-556.
61. PURDOM, P. Detecting looping simplifications. In Proceedings of the 2nd Conference on Rewrite Rule Theory and Applications (RTA) (May 1987), Springer, New York, 1987, 54-62.
62. REYNOLDS, J. Towards a theory of type structure. In Proceedings of the Programming Symposium. Springer, 1974, 408-425.
63. SCHWARTZ, J., DEWAR, R., DUBINSKY, E., AND SCHONBERG, E. Programming with Sets: An Introduction to SETL. Springer, New York, 1986.
64. STERLING, L., AND SHAPIRO, E. The Art of PROLOG. MIT Press, 1986.
65. TURNER, D. An overview of Miranda. SIGPLAN Not. 21, 12 (Dec. 1986), 158-166.
66. WAND, M. Finding the source of type errors. In Proceedings of the IEEE Symposium on Logic in Computer Science (June 1986), IEEE, New York, 1986, 38-43.