J. W. Backus, F. L. Bauer, J. Green, C. Katz, J. Mccarthy et al., Report on the algorithmic language ALGOL 60, Communications of the ACM, vol.3, issue.5, pp.299-314, 1960.
DOI : 10.1145/367236.367262

J. W. Backus, P. H. Diselets, D. C. Evans, R. Goodman, H. Huskey et al., Proposal for a programming language, ACM Ad Hoc Committee on Languages, 1958.

F. L. Bauer, H. Bottenbruch, H. Rutishauser, and K. Samelson, Proposal for a universal language for the description of computing processes, In Computer Programming and Artificial Intelligence, pp.355-373, 1958.

L. Cardelli and P. Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys, vol.17, issue.4, pp.471-523, 1985.
DOI : 10.1145/6041.6042

F. Cardone and J. R. Hindley, Lambda-Calculus and Combinators in the 20th Century, Logic from Russell to Church of Handbook of the History of Logic, pp.723-817, 2009.
DOI : 10.1016/S1874-5857(09)70018-4

A. Church, A formulation of the simple theory of types, The Journal of Symbolic Logic, vol.1, issue.02, pp.56-68, 1940.
DOI : 10.2307/2371199

H. B. Curry and R. Feys, Combinatory Logic, 1958.

H. B. Curry, On the composition of programs for automatic computing, 1949.

O. Dahl, The birth of object orientation: the Simula languages From Object-Orientation to Formal Methods is the core of what Mark Priestly [33] identifies as the " Algol research program, thinking to the design of programming languages which still today informs most work in programming language research, pp.15-25, 2004.

O. Dahl and K. Nygaard, SIMULA: an ALGOL-based simulation language, Communications of the ACM, vol.9, issue.9, pp.671-678, 1966.
DOI : 10.1145/365813.365819

M. Liesbeth-de-mol, M. Carlé, and . Bullyinck, Haskell before Haskell: an alternative lesson in practical logics of the ENIAC, Journal of Logic and Computation, vol.25, issue.4, pp.1011-1046, 2015.
DOI : 10.1093/logcom/exs072

J. Girard, Une extension de l'interprétation de Gödeì a l'analyse et son applicationàapplication`applicationà l'´ elimination des coupures dans l'analyse et la théorie des types, Proceedings of the Second Scandinavian Logic Symposium of Studies in Logic and the Foundations of Mathematics, pp.63-92, 1971.

A. Goldberg and A. Kay, Smalltalk-72 instruction manual, 1976.

R. Hindley, The principal type-scheme of an object in combinatory logic. Transactions of the, pp.29-60, 1969.

C. A. Hoare, Record handling, ALGOL Bull, vol.21, pp.39-69, 1965.

C. A. Hoare, Further thoughts on record handling, ALGOL Bull, vol.23, pp.5-11, 1966.

C. A. Hoare, Notes on data structuring, Structured programming, pp.83-174, 1972.

M. Grace and . Hopper, Automatic programming: present status and future trends, Mechanisation of Thought Processes: Proceedings of a Symposium held at the National Physical Laboratory, pp.155-194, 1959.

A. William and . Howard, The formulae-as-types notion of construction, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.479-490, 1980.

A. C. Kay, The early history of Smalltalk, ACM SIGPLAN Notices, vol.28, issue.3, pp.69-95, 1993.
DOI : 10.1145/155360.155364

P. Martin-löf, Constructive Mathematics and Computer Programming, Logic, Methodology and Philosophy of Science VI, pp.153-175, 1979.
DOI : 10.1016/S0049-237X(09)70189-2

S. Martini, Types in Programming Languages, Between Modelling, Abstraction, and Correctness, LNCS, vol.1, issue.12, 2016.
DOI : 10.1007/978-3-319-40189-8_17

URL : https://hal.archives-ouvertes.fr/hal-01335657

J. Mccarthy, Recursive functions symbolic expressions and their computation by machine, Part I, Communications of the ACM, vol.3, issue.4, pp.184-195, 1960.
DOI : 10.1145/367177.367199

J. Mccarthy, A basis for a mathematical theory of computation, preliminary report, Papers presented at the May 9-11, 1961, western joint IRE-AIEE-ACM computer conference on, IRE-AIEE-ACM '61 (Western), pp.225-238, 1961.
DOI : 10.1145/1460690.1460715

R. Milner, A theory of type polymorphism in programming, Journal of Computer and System Sciences, vol.17, issue.3, pp.348-375, 1978.
DOI : 10.1016/0022-0000(78)90014-4

J. H. Morris, Lambda-calculus models of programming languages, 1968.

J. H. Morris, Types are not sets, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '73, pp.120-124, 1973.
DOI : 10.1145/512927.512938

A. J. Perlis and K. Samelson, Preliminary report, Communications of the ACM, vol.1, issue.12, pp.8-22, 1958.
DOI : 10.1145/377924.594925

A. J. Perlis, The American side of the development of Algol History of programming languages I, pp.75-91, 1981.

M. Priestley, A Science of Operations. Machines, Logic and the Invention of Programming, 2011.

C. John and . Reynolds, Towards a theory of type structure, Programming Symposium , Proceedings. Colloque sur la programmation, pp.408-423, 1974.

C. John and . Reynolds, Types, abstraction and parametric polymorphism, Information Processing 83. Proceedings of the IFIP 9th World Computer Congress. Paris, pp.513-523, 1983.

R. L. Sites, Algol W reference manual, 1972.

N. Wirth and C. A. Hoare, A contribution to the development of ALGOL, Communications of the ACM, vol.9, issue.6, pp.413-432, 1966.
DOI : 10.1145/365696.365702