Summary: Polarized Subtyping for Sized Types
Andreas Abel
Computer Science Symposium Russia
June 10, 2006
Outline
Contents
1 Applications of Subtyping 1
1.1 Type­Based Termination . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Subtyping Collections . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2 Polarized Subtyping 3
2.1 Types as #­Expressions . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 Kinds and Polarities . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.3 Equality and Subtyping . . . . . . . . . . . . . . . . . . . . . . . . . 4
3 Algorithmic Subtyping 4
4 Completeness through Cut­Elimination 5
5 Conclusion 6
1 Applications of Subtyping
1.1 Type­Based Termination
Type­Based Termination
. Termination for higher­order functional programs.

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München

Collections: Computer Technologies and Information Sciences