Non-trivial Power Types Can't Be Subtypes of Polymorphic Types
暂无分享,去创建一个
[1] Andrew M. Pitts,et al. Polymorphism is Set Theoretic, Constructively , 1987, Category Theory and Computer Science.
[2] Gordon D. Plotkin,et al. The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[3] A. Pitts. INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7) , 1987 .
[4] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .
[5] John C. Reynolds,et al. Polymorphism is not Set-Theoretic , 1984, Semantics of Data Types.
[6] John C. Reynolds,et al. Types, Abstraction and Parametric Polymorphism , 1983, IFIP Congress.
[7] J. Lambek. A fixpoint theorem for complete categories , 1968 .
[8] Kim B. Bruce,et al. The Semantics of Second Order Polymorphic Lambda Calculus , 1984, Semantics of Data Types.
[9] R. A. G. Seely,et al. Categorical semantics for higher order polymorphic lambda calculus , 1987, Journal of Symbolic Logic.
[10] Andre Scedrov,et al. A Categorical Approach to Realizability and Polymorphic Types , 1987, MFPS.