Inductive Construction of Repletion

Applied Categorical Structures

Volumn 7, Issue 1-2, 1999, Pages 185-207

  Streicher, Thomas ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Constructive logic; Denotational semantics; Inductive definitions; Synthetic domain theory

Indexed keywords

EID: 0041724179     PISSN: 09272852     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008604622568     Document Type: Article

References (11)

1. Freyd, P. et al.: Extensional pers, in Logic in Computer Science 5, IEEE, 1990.
2. Hyland, J. M. E.: First steps towards synthetic domain theory, in Category Theory, Lecture Notes in Mathematics 1488, Springer, 1991, pp. 131-156.
3. Hyland, M. and Moggi, E.: The S-replete construction, in CTCS 55, Springer Lecture Notes in Computer Science 953, 1995, pp. 96-116.
4. Longley, J. R. and Simpson, A.: A uniform approach to domain theory in realisability models, Math. Structures Comput. Sci., 1995 to appear.
5. Luo, Z. and Pollack, R.: Lego proof development system: User's manual, Technical Report ECS-LFCS-92-211, University of Edinburgh, 1992.
6. McCarty, D.: Realizability and recursive mathematics, PhD Thesis, Carnegie-Mellon Univ., Pittsburgh, 1984.
7. Reus, B.: Program verification in synthetic domain theory, PhD Thesis, Ludwig-Maximilans-Univ., Munich, 1995.
8. Rosolini, G.: Notes on synthetic domain theory, Draft paper, Univ. of Genova, 1995.
9. Streicher, T.: Semantics of Type Theory, Birkhäuser, Basel, 1991.
10. Streicher, T.: Dependence and independence results for (impredicative) calculi of dependent types, Math. Structures Comput. Sci. 2 (1992), 29-54.
11. Taylor, P.: The fixed point property in synthetic domain theory, in Logic in Computer Science 6, IEEE, 1991, pp. 152-160.