Bounded quantifiers have interval models
暂无分享,去创建一个
[1] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..
[2] Andrew M. Pitts,et al. Polymorphism is Set Theoretic, Constructively , 1987, Category Theory and Computer Science.
[3] Simone Martini,et al. An Interval Model for Second-Order Lambda Calculus , 1987, Category Theory and Computer Science.
[4] Kim B. Bruce,et al. The Semantics of Second Order Polymorphic Lambda Calculus , 1984, Semantics of Data Types.
[5] Luca Cardelli,et al. Structural subtyping and the notion of power type , 1988, POPL '88.
[6] Kim B. Bruce,et al. A modest model of records, inheritance and bounded quantification , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[7] R. A. G. Seely,et al. Categorical semantics for higher order polymorphic lambda calculus , 1987, Journal of Symbolic Logic.
[8] John Mitchell,et al. Type Inference and Type Containment , 1984, Semantics of Data Types.
[9] John C. Mitchell,et al. The Semantics of Second-Order Lambda Calculus , 1990, Inf. Comput..
[10] Giuseppe Longo,et al. Computability in Higher Types, P omega and the Completeness of Type Assignment , 1986, Theor. Comput. Sci..
[11] Robert Cartwright,et al. Types as intervals , 1985, POPL.
[12] Luca Cardelli,et al. On understanding types, data abstraction, and polymorphism , 1985, CSUR.
[13] Luca Cardelli,et al. A Semantics of Multiple Inheritance , 1984, Information and Computation.
[14] Gordon D. Plotkin,et al. An ideal model for recursive polymorphic types , 1984, Inf. Control..
[15] John C. Reynolds,et al. Towards a theory of type structure , 1974, Symposium on Programming.