Interpreting higher computations as types with totality

1. Berger, U.: Total sets and objects in Domain Theory. Ann Pure Appl Logic60, 91–117 (1993)

   Google Scholar 

2. Girard, J.-Y.: Une extension de l'interprétation de Gödel et à la théorie des types etc. In J. E. Fenstad (ed.): Proc. 2nd Scand. Log. Symp., North Holland (1971)

3. Girard, J.-Y.: 258-1, Part 1: Dilators. Ann. Math Logic21 75–219 (1981)

   Google Scholar 

4. Girard, J.-Y.: The system F of variable types fifteen years later. Theor. Comp. Science45 159–192 (1986)

   Google Scholar 

5. Girard, J.-Y.: Proof theory and logical complexity, part II. To appear at North Holland Publishing Company

6. Kleene, S.C.: Recursive functionals and Quantifiers of finite types I. T.A.M.S.91 1–52 (1959)

   Google Scholar 

7. Kristiansen, L.: Totality in qualitative domains. Dr. Scient. Thesis, University of Oslo, 1993

8. Kristiansen, L., Normann, D.: Semantics for some constructors of type theory. To appear in the proceedings of the Gauss symposium, Munich 1993

9. Kristiansen, L., Normann, D.: Total objects in inductively defined types. (In preparation)

10. Normann, D.: Formalizing the notion of total information. In: P.P. Petkov (ed.) Mathematical Logic, pp. 67–94, Plenum Press, 1990

11. Normann, D.: Wellfounded and non-wellfounded types of continuous functionals. Oslo Preprint Series in Mathematics No 6 (1992)

12. Normann, D.: Closing the gap between the continuous functionals and recursion in³ E. Presented at the Sacks-symposium, MIT 1993

Download references