Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time

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

Volumn 983, Issue , 1995, Pages 118-135

  Dussart, Dirk ^a   Henglein, Fritz ^b   Mossin, Christian ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b DIKU Denmark ^*  (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; INFERENCE ENGINES; ITERATIVE METHODS; POLYNOMIAL APPROXIMATION;

ALGORITHMIC PROBLEMS; BINDING TIME ANALYSIS; EXPONENTIAL TIME; INFERENCE ALGORITHM; POLYMORPHIC RECURSION; POLYMORPHIC TYPES; PROGRAM ANALYSIS; SIMPLE MODIFICATIONS;

STATIC ANALYSIS;

EID: 52849104882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60360-3_36     Document Type: Conference Paper

References (17)

1. A. Aiken, E. L. Wimmers, and T. Lakshman. Soft typing with conditional types. In Proc. 21st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Portland, Oregon. ACM, ACM Press, Jan. 1994.
2. J. Cai and R. Paige. Program derivation by fixed point computation. Science of Computer Programming, 11:197-261, 1989.
3. C. Consel, P. Jouvelot, and P. Orbaek. Seperate polyvariant binding time reconstruction. Technical Report CRI Report A/261, Ecole des Mines, Oct. 1994.
4. L. Damas. Type Assignment in Programming Languages. PhD thesis, University of Edinburgh, 1984. Technical Report CST-33-85 (1985).
5. L. Damas and R. Milner. Principal type schemes for functional programs. In Proc. 9th Annual ACM Symp. on Principles of Programming Languages, pages 207-212, Jan. 1982.
6. F. Henglein. Type inference and semi-unification. In Proc. ACM Conf. on LISP and Functional Programming (LFP), Snowbird, Utah, pages 184-197. ACM Press, July 1988.
7. F. Henglein and C. Mossin. Polymorphic binding-time analysis. In D. Sanella, editor, 5th European Symposium on Programming, LNCS 788, pages 287-301. Springer-Verlag, 1994.
8. M. Jones. A theory of qualified types. In Proc. l^th European Symposium on Programming (ESOP), Rennes, France, volume 582 of Lecture Notes in Computer Science, pages 287-306. Springer-Verlag, Feb. 1992.
9. S. Kaes. Type inference in the presence of overloading, subtyping, and recursive types. In Proc. ACM Conf on LISP and Functional Programming (LFP), San Francisco, California, pages 193-204. ACM Press, June 1992.
10. A. Kfoury, J. Tiuryn, and P. Urzyczyn. The undecidability of the semi-unification problem. Technical Report BUCS-89-010, Boston University, Oct. 1989. also in Proc. of Symp. on Theory of Computing, Baltimore, Maryland, May 1990.
11. R. Milner. A theory of type polymorphism in programming. J. Computer and System Sciences, 17:348-375, 1978.
12. A. Mycroft. Polymorphic type schemes and recursive definitions. In Proc. 6th Int. Conf. on Programming, LNCS 167, 1984.
13. H. Nielson and F. Nielson. Automatic binding time analysis for a typed lambda calculus. Science of Computer Programming, 10:139-176, 1988.
14. M. Rittri. Dimension inference under polymorphic recursion. In Proc. Conf. on Functional Programming Languages and Computer Architecture (FPCA), San Diego, California. ACM Press, June 1995.
15. G. S. Smith. Polymorphic type inference with overloading and subtyping. In Proc. Theory and Practice of Software Development (TAPSOFT), Orsay, France, volume 668 of Lecture Notes in Computer Science, pages 671-685. Springer-Verlag, April 1993.
16. M. Tofte. Personal communication, June 1995.
17. M. Tofte and J.-P. Talpin. Implementation of the typed call-by-value A-calculus using a stack of regions. In Proc. 21st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Portland, Oregon (this proceedings). ACM, ACM Press, Jan. 1994.