A syntactic proof of the conservativity of λω over λ2
暂无分享，去创建一个
In this paper, the relationship between the second order typed λ-calculus λ2 and its higher order version λω is discussed. A purely syntactic proof of the conservativity of λω over λ2 is given.
[1] Hendrik Pieter Barendregt,et al. Introduction to generalized type systems , 1991, Journal of Functional Programming.
[2] Herman Geuvers,et al. Conservativity between Logics and Typed lambda Calculi , 1993, TYPES.