Type Inference with Non-structural Subtyping

Formal Aspects of Computing

Volumn 9, Issue 1, 1997, Pages 49-67

  Palsberg, Jens ^a   Wand, Mitchell ^b   O'Keefe, Patrick ^c  

^a Purdue University   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

^c NONE   (United States)

Author keywords

Algorithms; Constraints; Languages; Type systems

Indexed keywords

EID: 0005495277     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01212524     Document Type: Article

References (14)

1. Amadio, R. M. and Cardelli, L.: Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, 1993. Also in Proc. POPL'91.
2. Amadio, R. M. and Cardelli, L.: Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, 1993. Also in Proc. POPL'91.
3. Kozen, D., Palsberg, J. and Schwartzbach, M. I.: Efficient inference of partial types. Journal of Computer and System Sciences, 49(2):306-324, 1994. Preliminary version in Proc. FOCS'92, 33rd IEEE Symposium on Foundations of Computer Science, pages 363-371, Pittsburgh, Pennsylvania, October 1992.
4. Kozen, D., Palsberg, J. and Schwartzbach, M. I.: Efficient inference of partial types. Journal of Computer and System Sciences, 49(2):306-324, 1994. Preliminary version in Proc. FOCS'92, 33rd IEEE Symposium on Foundations of Computer Science, pages 363-371, Pittsburgh, Pennsylvania, October 1992.
5. Kozen, D., Palsberg, J. and Schwartzbach, M. I.: Efficient recursive subtyping. Mathematical Structures in Computer Science, 5(1):113-125, 1995. Preliminary version in Proc. POPL'93, Twentieth Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 419-428, Charleston, South Carolina, January 1993.
6. Kozen, D., Palsberg, J. and Schwartzbach, M. I.: Efficient recursive subtyping. Mathematical Structures in Computer Science, 5(1):113-125, 1995. Preliminary version in Proc. POPL'93, Twentieth Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 419-428, Charleston, South Carolina, January 1993.
7. Mitchell, J.: Coercion and type inference. In Eleventh Symposium on Principles of Programming Languages, pages 175-185, 1984.
8. Mitchell, J. C.: Type inference with simple subtypes. Journal of Functional Programming, 1:245-285, 1991.
9. Palsberg, J. and O'Keefe, P. M.: A type system equivalent to flow analysis. ACM Transactions on Programming Languages and Systems, 17(4):576-599, July 1995. Preliminary version in Proc. POPL'95, 22nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 367-378, San Francisco, California, January 1995.
10. Palsberg, J. and O'Keefe, P. M.: A type system equivalent to flow analysis. ACM Transactions on Programming Languages and Systems, 17(4):576-599, July 1995. Preliminary version in Proc. POPL'95, 22nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 367-378, San Francisco, California, January 1995.
11. Palsberg, J. and Schwartzbach, M. I.: Safety analysis versus type inference for partial types. Information Processing Letters, 43:175-180, 1992.
12. Thatte, S.: Type inference with partial types. In Proc. International Colloquium on Automata, Languages, and Programming 1988, pages 615-629. Springer-Verlag (LNCS 317), 1988.
13. Wand, M.: Type inference for record concatenation and multiple inheritance. Information and Computation, 93(1):1-15, 1991.
14. Wand, M., O'Keefe, P. M. and Palsberg, J.: Strong normalization with non-structural subtyping. Mathematical Structures in Computer Science, 5(3):419-430, 1995.