ML typability is dexptime-complete

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

Volumn 431 LNCS, Issue , 1990, Pages 206-220

  Kfoury, A J ^a   Tiuryn, J ^b   Urzyczyn, P ^b  

^a BOSTON UNIVERSITY   (United States)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

EXPONENTIAL TIME ALGORITHM; LOG SPACE;

ALGEBRA;

EID: 0346317999     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52590-4_50     Document Type: Conference Paper

References (13)

1. Clément, D., Despeyroux, J., Despeyroux, T., Kahn, G., “A simple applicative language: Mini-ML”, Proc, ACM Conference on Lisp and Functional Programming, pp 13-27, 1986
2. Chandra, A. K., Kozen, D. and Stockmeyer, L. “Alternation,” J. Assoc. Comput. Mach.28:1, pp 114-133, 1981.
3. Dwork, C., Kanelakis, P., Mitchell, J. C., “On the sequential nature of unification”, J. of Logic Programming, 1, pp 35-50, 1984.
4. Damas, L. and Milner, R., “Principal type schemes for functional programs,” Proc. 9-th ACM Symp. Principles of Prog. Lang., pp 207-212, 1982.
5. Henglein, F., “Type inference and semi-unification”, Proc. ACM Symp. LISP and Functional Programming, July 1988.
6. Kanellakis, P., Mitchell, J. C., “Polymorphic unification and ML typing”, Proc. 16-th Symp. on Principles of Prog. Lang., pp 105-115, Jan 1989.
7. Kapur, D., Musser, D., Narendran, P., and Stillman, J., “Semi-unification”, Proc. of 8-th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, Dec, 1988.
8. Kfoury, A. J., Tiuryn, J. and Urzyczyn, P., “Computational consequences and partial solutions of a generalized unification problem”, Proc. of IEEE 4-th LICS 1989.
9. Kfoury, A. J., Tiuryn, J. and Urzyczyn, P., “Undecidability of the semi-unification problem” Manuscript, October 1989.
10. Milner, R., “A theory of type polymorphism in programming”, J. of Computer and System Sciences, Vol. 17, pp 348-375, 1978.
11. Milner, R., “The standard ML core language”, Polymorphism, II (2), October 1985.
12. Paterson, M. S., Wegman, M. N., “Linear unification”, JCSS, 16, pp 158-167, 1978.
13. Tyszkiewicz, J. “Typability in the finitely typed lambda calculus is PTIME-complete,” MS thesis, University of Warsaw, 1987.