Intensional Semantics of System T of Gödel

Amadio, 1998 Berry, 1982, Sequential algorithms on concrete data structure, Theoretical Computer Science, 20 9, 265, 10.1016/S0304-3975(82)80002-9 Colson, 1991, About primitive recursive algorithms, Theoretical Computer Science, 83, 57, 10.1016/0304-3975(91)90039-5 Colson, 1991, “Représentation intensionnelle d'algorithmes dans les systèmes fonctionnels,”, Thèse de doctorat, Université de Paris, 7 Colson, 1996, A unary representation result for system t, Annals of Mathematics and Artificial Intelligence, 16, 385, 10.1007/BF02127804 Coquand, T., Une preuve directe du théorème d'ultime obstination, Compte Rendus de 1'Académie des Sc. 314 Serie I (1992). Crolard, T., S. Lacas and P. Valarcher, The inf problem in the imperative paradigm, Manuscript. David, R., Un algorithms primitif récursif pour la fonction inf, Compt. Rend, de 1'Aca. des Scie. 317 Série I (1993). Escardo, 1993, On lazy natural numbers with applications, SIGACT News, 24, 10.1145/152992.153008 Fredholm, 1996, Computing minimum with primitive recursion over lists, Theoretical Computer Science, 163, 10.1016/0304-3975(95)00243-X Gödel, 1980, On a hitherto unexploited extension of the finitary standpoint, J. Philos. Logic, 9, 10.1007/BF00247744 Taylor, P., J.-Y. Girard and Y. Lafont, “Proofs and Types,” Volume 7, Cambridge Tracts in Theorical Comp. Sci., 1989. Kahn, 1993, Concrete domains, Theoretical Computer Science, 121, 187, 10.1016/0304-3975(93)90090-G Krivine, 1987, Un algorithme non typable dans le systeme F, Compt. Rend, de 1'Acad. des Sci. Paris, 304 Ong, 1993, Correspondence between operational and denotational semantics, Handbook of Theoritical Computer Science, 4 Roza, 1968 Plotkin, 1976, LCF considered as a programming language, Theoret. Comput. Sci, 5 Turner, D. A., Elementary strong functional programming, in: Functional Programming Languages in Education. Valarcher, 1996, A complete characterization of intensional behaviours of primitive recursive algorithms, Rapport de Recherche du LIR, 96.11 Valarcher, 1996, 7 Valarcher, P., Intensionality vs extensionality and primitive recursion, ASIAN Computing Science Conference, Lecture Notes in Computer Science 1179 (1996).