Expansion Postponement for Normalising Pure Type Systems
暂无分享,去创建一个
Expansion postponement is a tantalisingly simple conjecture about pure type systems which has so far resisted all attempts to prove it for any interesting class of systems. We prove the property for all normalising pure type systems, and discuss the connection with typechecking.
[1] E. Poll,et al. A Typechecker for Bijective Pure Type Systems , 1993 .
[2] Robert Pollack. The theory of LEGO , 1995 .
[3] H. P. Barendregt. Introduction to generalised type systems, invited talk , 1989 .
[4] James McKinna,et al. Checking Algorithms for Pure Type Systems , 1994, TYPES.