Functorial Polymorphism

[1]  S. Lane.  Categories for the Working Mathematician , 1971 .

[2]  Robin Milner,et al.  A proposal for standard ML , 1984, LFP '84.

[3]  John C. Mitchell,et al.  The essence of ML , 1988, POPL '88.

[4]  Thierry Coquand,et al.  Constructions: A Higher Order Proof System for Mechanizing Mathematics , 1985, European Conference on Computer Algebra.

[5]  Edmund Robinson,et al.  How complete is PER? , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[6]  Dana S. Scott,et al.  Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.

[7]  Harold T. Hodes,et al.  The | lambda-Calculus. , 1988 .

[8]  John Barnes,et al.  Programming in ADA , 1989 .

[9]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[10]  米田 信夫,et al.  On ext and exact sequences , 1961 .

[11]  Gérard Huet.  A uniform approach to type theory , 1990 .

[12]  R. A. G. Seely,et al.  Categorical semantics for higher order polymorphic lambda calculus , 1987, Journal of Symbolic Logic.

[13]  Martin Hyland.  A small complete category , 1988, Ann. Pure Appl. Log..

[14]  Kim B. Bruce,et al.  A Modest Model of Records, Inheritance and Bounded Quantification , 1990, Inf. Comput..

[15]  Corrado Böhm,et al.  Automatic Synthesis of Typed Lambda-Programs on Term Algebras , 1985, Theor. Comput. Sci..

[16]  Andre Scedrov,et al.  A Categorical Approach to Realizability and Polymorphic Types , 1987, MFPS.

[17]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[18]  Craig Schaffert,et al.  CLU Reference Manual , 1984, Lecture Notes in Computer Science.

[19]  John C. Reynolds,et al.  Preliminary design of the programming language Forsythe , 1988 .

[20]  G. M. Kelly,et al.  A generalization of the functorial calculus , 1966 .

[21]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[22]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[23]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[24]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[25]  John C. Mitchell,et al.  Second-Order Logical Relations (Extended Abstract) , 1985, Logic of Programs.

[26]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[27]  P. J. Landin,et al.  The next 700 programming languages , 1966, CACM.

[28]  José Meseguer,et al.  Relating models of polymorphism , 1989, POPL '89.

[29]  Gérard Huet.  Deduction and computation , 1986 .

[30]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[31]  P. Martin-Löf.  Constructive mathematics and computer programming , 1984 .

[32]  John C. Reynolds,et al.  Polymorphism is not Set-Theoretic , 1984, Semantics of Data Types.

[33]  Andre Scedrov,et al.  Semantic parametricity in polymorphic lambda calculus , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[34]  J. Hyland.  The Effective Topos , 1982 .

[35]  Edmund Robinson,et al.  Algebraic Types in PER Models , 1989, Mathematical Foundations of Programming Semantics.

[36]  John C. Reynolds,et al.  Types, Abstraction and Parametric Polymorphism , 1983, IFIP Congress.

[37]  Andrew M. Pitts,et al.  Polymorphism is Set Theoretic, Constructively , 1987, Category Theory and Computer Science.

[38]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[39]  Glynn Winskel,et al.  DI-Domains as a Model of Polymorphism , 1987, MFPS.

[40]  Thierry Coquand,et al.  Extensional Models for Polymorphism , 1988, Theor. Comput. Sci..