Abstract:
This paper establishes the decidability of typechecking in Fw/\ (F-omega-meet), a typed lambda calculus combining higher-order polymorphism, subtyping, and intersection types. It contains the first proof of decidability of subtyping for a higher-order system.
ECS-LFCS-97-365.This report is available in the following formats:
Previous | Index | Next An error occured whilst processing this directive