General synthetic domain theory - a logical approach

Mathematical Structures in Computer Science

Volumn 9, Issue 2, 1999, Pages 177-223

  Reus, Bernhard ^a   Stretcher, Thomas ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84967593897     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096012959900273X     Document Type: Article

References (38)

1. Birkedal, L., Carboni, A., Rosolini, G. and Scott, D. S. (1998) Type theory in exact categories. 13th symp. in Logic in Computer Science, IEEE Comp. Soc. Press (to appear).
2. Crole, R. L., and Pitts, A. M. (1992) New foundations for fixpoint computations: Fix-hyperdoctrines and the fix-logic. Information and Computation 98 171–210.
3. Dybjer, P. (1994) Inductive families. Formal aspects of computing 6 440–465.
4. Ershov, Y. L. (1973) Theorie der Numerierungen I. Zeitschrift fur Math. Logik 19 289–388.
5. Ershov, Y. L. (1977) Model C of partial continuous functionals. In: Gandy, R. and Hyland, M. (eds.) Logic colloquium 1976, North-Holland 455–467.
6. Fiore, M. and Rosolini, G. (1997) Two models of synthetic domain theory. Journ. Pure and Appl. Alg. 116 151–162.
7. Freyd, P. (1991) Algebraically complete categories. In: Carboni, A., Pedicchio, M. C. and Rosolini, G. (eds.) Proceedings of the 1990 Como category theory conference. Springer-Verlag Lecture Notes in Mathematics 1488 95–104
8. Freyd, P. (1992) Remarks on algebraically compact categories. Applications of categories in computer science. Notes of the London Mathematical Society 177.
9. Freyd, P. and Kelly, G. (1972) Categories of continuous functors. Journal of Pure and Applied Algebra 2 169–191.
10. Freyd, P, Mulry, R, Rosolini, G. and Scott, D. (1992) Extensional PERs. Information and Compu-tation 98 211–227.
11. Hyland, J. M. E. (1988) A small complete category. Annals of Pure and Applied Logic 40 135–165.
12. Hyland, J. M. E. (1991) First steps in synthetic domain theory. In: Carboni, A., Pedicchio, M. C. and Rosolini, G. (eds.) Proceedings of the 1990 Como category theory conference. Springer-Verlag Lecture Notes in Mathematics 1488 131–156.
13. Jibladze, M. (1997) A presentation of the initial lift-algebra. J. Pure Appl. Algebra 116 (1–3) 185–198.
14. Kock, A. (1981) Synthetic differential geometry, Cambridge University Press.
15. Lambek, J. and Scott, P. J. (1980) Introduction to higher order categorical logic, Cambridge Studies in Advanced Mathematics 7, Cambridge University Press.
16. Lavendhomme, R. (1987) Lecon de geometrie differentielle syntetique naive, Monographies de Matematique 3, Louvain-la-Neuve.
17. Longley J. R. (1994) Realizability toposes and language semantics. Ph. D. thesis, University of Edinburgh.
18. Longley, J. R. and Simpson, A. K. (1997) A uniform approach to domain theory in realizability models. Mathematical Structures in Computer Science 1453–1468. (Special edition for the Workshop on Logic, Domains and Programming Languages, Darmstadt, Germany.)
19. Luo, Z. (1994) Computation and reasoning - a type theory for computer science, Monographs on Computer Science 11, Oxford University Press.
20. Luo, Z. and Pollack, R. (1992) Lego proof development system: User's manual. Technical Report ECS-LFCS-92-211, Edinburgh University.
21. Paulson, L. C. (1987) Logic and Computation, Cambridge Tracts in Theoretical Computer Science 2, Cambridge University Press.
22. Phoa, W. K. (1990) Domain theory in realizability toposes. Ph. D. thesis, University of Cambridge. (Also available as report ECS-LFCS-91-171, University of Edinburgh.)
23. Regensburger, F. (1994) HOLCF : Fine konservative Erweiterung von HOL um LCF, Ph. D. thesis, Technische Universitat Munchen.
24. Reus, B. (1995) Program verification in synthetic domain theory, Ph. D. thesis, Ludwig-Maximilians- Munchen. (Shaker Verlag, Aachen, 1996.) Reus, B. (1996) Synthetic domain theory in type theory: Another logic of computable functions. In: von Wright, J., Grundy, J. and Harrison, J. (eds.) Theorem proving in higher order logics: 9th international conference (TPHOLs’96). Springer-Verlag Lecture Notes in Computer Science 1125 363–381.
25. Reus, B. (1998) Extensional E-spaces in type theory. Applied Categorical Structures (to appear).
26. Reus, B. and Streicher, T.H. 1943 (September) Naive Synthetic Domain Theory - a logical approach (draft).
27. Reus, B. and Streicher, Th. (1997) General Synthetic Domain Theory - a logical approach (extended abstract). In: Moggi, E. and Rosolini, G. (eds.) 7th Conf. Category Theory in Computer Science. Springer-Verlag Lecture Notes in Computer Science 1290 293–313.
28. Rogers, H. (1967) Theory of recursive functions and effective computability, McGraw-Hill.
29. Rosolini, G. (1986) Continuity and effectiveness in topoi, Ph. D. thesis, University of Oxford.
30. Rosolini, G. (1987) Categories and effective computation. In: Pitt, D. H., Poigne, A. and Rydeheard, D. E. (eds.) Category theory and computer programming, 1985, Guildford. Springer-Verlag Lecture Notes in Computer Science 283 1–11.
31. Rosolini, G. (1995) Notes on synthetic domain theory (draft).
32. Scott, D. S. (1970) Outline of a mathematical theory of computation. Proc. of the 4th Annual Princeton Conference on Information Sciences, Princeton University 169–176.
33. Scott, D. S. (1972) Continuous lattices. In: Lawvere, F. W. (ed.) Toposes, Algebraic Geometry and Logic, Dalhousie University, Halifax 1971. Springer-Verlag Lecture Notes in Mathematics 274 97–136.
34. Scott, D. S. (1993) A type theoretic alternative to ISWIM, CUCH, OWHY. Theoretical Computer Science 121 411–440. (Reprint of a manuscript written in 1969.)
35. Simpson, A. K. (1996) Domain theory in intuitionistic set theory (draft).
36. Smyth, M. B. and Plotkin, G. D. (1982) The category-theoretic solution to recursive domain equations. Siam Journal of Computing 11 761–783.
37. Streicher, T.H. (1998) Inductive Construction of Repletion. Applied Categorical Structures (to appear).
38. Taylor, P. (1991) The fixed point property in synthetic domain theory. 6th symp. on Logic in Computer Science, IEEE Computer Soc. Press 152–160.