A type-theoretic interpretation of constructive domain theory

Journal of Automated Reasoning

Volumn 16, Issue 3, 1996, Pages 369-425

  Hedberg, Michael ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Cartesian closure; Domains; Type theory

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONFORMAL MAPPING; FORMAL LOGIC; LEARNING SYSTEMS; RECURSIVE FUNCTIONS; THEOREM PROVING;

CARTESIAN CLOSURE; CONSTRUCTIVE DOMAIN THEORY; TYPE THEORY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0030172934     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00252182     Document Type: Article

References (20)

1. Aczel, P.: Frege structures and the notions of proposition, truth and set, in The Kleene Symposium, North-Holland, 1980, pp 31-59.
2. Augustsson, L., Coquand, T., and Nordström, B.: A short description of another logical framework, in Proceedings of the First Workshop on Logical Frameworks, Antibes, 1990, pp. 39-42.
3. Augustsson, L., Coquand, T., and Nordström, B.: A short description of another logical framework, in G. Huet and G. Plotkin (eds), Proceedings of the First Workshop on Logical Frameworks, Antibes, May 1992.
4. Dybjer, P.: Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics, in Logical Frameworks, Cambridge University Press, 1991, pp. 280-306.
5. Eklund, E.: A Domain-Theoretic Model for the Terms of Intuitionistic Type Theory, U.U.D.M. Project Report 1987:P3.
6. Girard, J.: Une extension de l'interprétation de Gödel à l'analyse, et son application à l'elimination des coupures dans l'analyse et la théorie des types, in J. E. Fenstad (ed.), Proceedings of the Second Scandinavian Logic Symposium, North-Holland, 1971, pp. 63-92.
7. Griffor, E. R., Lindström, I., and Stoltenberg-Hansen, V.: Mathematical Theory of Domains, Cambridge University Press, 1994.
8. Hedberg, M.: Normalizing the associative law: An experiment with Martin-Löf's type theory, Formal Aspects of Computing 3 (1991), 218-252.
9. Hofmann, M.: A Model of Intensional Martin-Löf Type Theory in Which Unicity of Identity Proofs Does Not Hold. Technical Report, Dept. of Computer Science, University of Edinburgh, Draft, June 1993.
10. Martin-Löf, P.: A Theory of Types. Technical Report 72-118, University of Stockholm, 1971.
11. Martin-Löf, P.: The domain interpretation of type theory, lecture notes, in K. Karlsson and K. Petersson (eds), Workshop on Semantics of Programming Languages, Abstracts and Notes, Chalmers University of Technology and University of Göteborg, Programming Methodology Group, August 1983.
12. Martin-Löf, P.: Intuitionistic Type Theory, Bibliopolis, Napoli, 1984.
13. Nordström, B., Petersson, K., and Smith, J. M.: Programming in Martin-Löf's Type Theory. An Introduction, Oxford University Press, 1990.
14. Palmgren, E.: A Domain Interpretation of Martin-Löf's Partial Type Theory with Universes, U.U.D.M. Report 1989:11.
15. Palmgren, E. and Stoltenberg-Hansen, V.: Domain interpretations of Martin-Löf's partial type theory, Annals of Pure and Applied Logic 48 (1990), 135-196.
16. Salvesen, A.: Polymorphism and Monomorphism in Martin-Löf's Type Theory, Technical Report, Norwegian Computing Center, December 1988.
17. Sambin, G., Valentini, S., and Virgili, P.: Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology, Padova, 1991.
18. Scott, D.: Continuous lattices, in Springer Lecture Notes in Mathematics 274 (1972), pp. 97-136.
19. Scott, D.: Lectures on a Mathematical Theory of Computation, Technical Report PRG-19, Oxford University Programming Research Group, May 1981.
20. Scott, D.: Domains for denotational semantics, in Automata, Languages and Programming, 9th Colloquium, Springer-Verlag, LNCS 140, July 1982, pp. 577-613.