CSL
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...