Skip to main content Accessibility help
×
Home

Strong normalization with non-structural subtyping

  • Mitchell Wand (a1), Patrick O'Keefe (a2) and Jens Palsberg (a3)

Abstract

We study a type system with a notion of subtyping that involves a largest type ⊤, a smallest type ⊥, atomic coercions between base types, and the usual ordering of function types. We prove that any λ-term typable in this system is strongly normalizing, which solves an open problem of Thatte. We also prove that the fragment without ⊥ types has strictly fewer terms. This demonstrates that ⊥ adds power to a type system.

Copyright

References

Hide All
Amadio, R. M. and Cardelli, L. (1993) Subtyping recursive types. ACM Transactions on Programming Languages and Systems 15 (4) 575631. (Also in Proc. POPL’91.)
Giannini, P. and Ronchi Della Rocca, S. (1988) Characterization of typings in polymorphic type discipline. Proc. LICS’88, Third Annual Symposium on Logic in Computer Science 6170.
Gomard, C. K. (1990) Partial type inference for untyped functional programs. Proc. ACM Conference on Lisp and Functional Programming 282287.
Kozen, D., Palsberg, J. and Schwartzbach, M. I. (1994) Efficient inference of partial types. Journal of Computer and System Sciences 49 (2) 306324.(Also in Proc. FOCS’92, 33rd IEEE Symposium on Foundations of Computer Science, October 1992, Pittsburgh, Pennsylvania, 363–371.)
Mitchell, J. C. (1991) Type inference with simple subtypes. Journal of Functional Programming 1 245285.
O’Keefe, P. M. and Wand, M. (1992) Type inference for partial types is decidable. Proc. ESOP’92, European Symposium on Programming. Springer-Verlag Lecture Notes in Computer Science 582 408417.
Palsberg, J. and Schwartzbach, M. I. (1992) Safety analysis versus type inference for partial types. Information Processing Letters 43 175180.
Rémy, D. (1989) Typechecking records and variants in a natural extension of ML. Sixteenth Symposium on Principles of Programming Languages 7788.
Thatte, S. (1988) Type inference with partial types. Proc. International Colloquium on Automata, Languages, and Programming 1988. Springer-Verlag Lecture Notes in Computer Science 317 615629.
Wand, M. (1984) A semantic prototyping system. Proc. ACM SIGPLAN’84 Symposium on Compiler Construction, Sigplan Notices 213221.
Wand, M. (1991) Type inference for record concatenation and multiple inheritance. Information and Computation 93 (1) 115.

Related content

Powered by UNSILO

Strong normalization with non-structural subtyping

  • Mitchell Wand (a1), Patrick O'Keefe (a2) and Jens Palsberg (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.