Categorical semantics for higher order polymorphic lambda calculus

On definit une structure categorique adaptee a l'interpretation du lambda-calcul polymorphe, qui fournit une semantique algebrique solide et complete

[1]  Nancy Jean Mccracken,et al.  An investigation of a programming language with a polymorphic type structure. , 1979 .

[2]  Hendrik Pieter Barendregt,et al.  Semantics for Classical AUTOMATH and Related Systems , 1984, Inf. Control..

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

[4]  Robert A. G. Seely,et al.  Hyperdoctrines, Natural Deduction and the Beck Condition , 1983, Math. Log. Q..

[5]  R. Seely,et al.  Locally cartesian closed categories and type theory , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.

[6]  J. Girard.  Ouelques Resultats sur les Interpretations Fonctionnelles , 1973 .

[7]  Rod M. Burstall,et al.  HOPE: An experimental applicative language , 1980, LISP Conference.

[8]  Robert Paré,et al.  Abstract families and the adjoint functor theorems , 1978 .

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

[10]  A. R. D. Mathias,et al.  Cambridge Summer School in Mathematical Logic , 1973 .

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

[12]  Peter Freyd,et al.  Aspects of topoi , 1972, Bulletin of the Australian Mathematical Society.

[13]  Robin Milner.  The standard ML core language , 1984 .

[14]  Philip J. Scott.  The "Dialectica" Interpretation and Categories , 1978, Math. Log. Q..

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

[16]  J. Girard.  Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types , 1971 .

[17]  Kim B. Bruce,et al.  The Semantics of Second Order Polymorphic Lambda Calculus , 1984, Semantics of Data Types.