Equilogical spaces

Theoretical Computer Science

Volumn 315, Issue 1, 2004, Pages 35-59

  Bauer, Andrej ^a   Birkedal, Lars ^a,b   Scott, Dana S ^a  

^a Carnegie Mellon University   (United States)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Domain theory; Logic; Realizability; Topology; Type theory

Indexed keywords

ALGEBRA; FINITE ELEMENT METHOD; FORMAL LOGIC; HIERARCHICAL SYSTEMS; ITERATIVE METHODS; TOPOLOGY;

DOMAIN THEORY; REALIZABILITY; TYPE THEORY;

COMPUTER SCIENCE;

EID: 2042508364     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.11.012     Document Type: Conference Paper

References (40)

1. Amadio R.M., Curien P.-L. Domains and Lambda-Calculi. Cambridge Tracts in Theoretical Computer Science. Vol. 46:1998;Cambridge University Press, Cambridge.
2. M. Barr, Exact categories, in: M. Barr, P.A. Grillet, D.H. van Osdol (Eds.), Exact Categories and Categories of Sheaves, Lecture Notes in Mathematics, Vol. 236, Spinger, Berlin, 1971, pp. 1-120.
3. A. Bauer, The Realizability Approach to Computable Analysis and Topology, Ph.D. Thesis, Carnegie Mellon University, 2000, available as CMU Tech. Report CMU-CS-00-164 and at http://andrej.com/thesis .
4. A. Bauer, L. Birkedal, Continuous functionals of dependent types and equilogical spaces, in: P. Clote, H. Schwichtenberg (Eds.), Computer Science Logic, 14th Ann. Conf. of the EACSL, Fischbachau, Germany, August 21-26, 2000, Lecture Notes in Computer Science, Vol. 1862, Springer, Berlin, August 2000.
5. Berger U. Total sets and objects in domain theory. Ann. Pure Appl. Logic. 60:1993;91-117.
6. U. Berger, Continuous Functionals of Dependent and Transitive Types, Habilitationsschrift, Ludwig-Maximilians-Universität München, 1997.
7. L. Birkedal, Developing theories of types and computability via realizability, Electronic Notes in Theoretical Computer Science, 34:viii+282, 2000 (book version of Ph.D. Thesis).
8. L. Birkedal, A general notation of realizability, in: Proc. 15th Ann. IEEE Symp. on Logic in Computer Science, Santa Barbara, CA, IEEE Computer Society, Silver Spring, MD, June 2000, pp. 7-17.
9. L. Birkedal, A. Carboni, G. Rosolini, D.S. Scott, Type theory via exact categories, in: Proc. 13th Ann. IEEE Symp. on Logic in Computer Science, IEEE Computer Society, Indianapolis, Indiana, June 1998, pp. 188-198.
10. Borceux F. Handbook of Categorical Algebra I. Basic Category Theory. Encyclopedia of Mathematics and Its Applications. Vol. 51:1994;Cambridge University Press, Cambridge.
11. A. Carboni, P.J. Freyd, A. Scedrov, A categorical approach to realizability and polymorphic types, in: Mathematical Foundations of Programming Semantics, Proc. New Orleans, Louisiana, Lecture Notes in Computer Science, Vol. 298, Springer, Berlin, 1988, pp. 23-42.
12. J. Cartmell, Generalized algebraic theories and contextual categories, Ph.D. Thesis, University of Oxford, 1978.
13. Davey B.A., Priestley H.A. Introduction to Lattices and Order. 1990;Cambridge University Press, Cambridge.
14. Th. Ehrhard, A categorical semantics of constructions, in: Proc. 3rd Ann. IEEE Symposium on Logic in Computer Science, Computer Society Press, Washington, 1988, pp. 264-273.
15. Y.L. Ershov, Model C for partial continuous functionals, in: Logic Colloquium 1976, North-Holland, Amsterdam, 1977, pp. 455-467.
16. Gierz G., Hofmann K.H., Keimel K., Lawson J.D., Mislove M., Scott D.S. A Compendium of Continuous Lattices. 1980;Springer, Berlin.
17. M. Hofmann, On the interpretation of type theory in locally cartesian closed categories, in: J. Tiuryn, L. Pacholski (Eds.), Proc. of Computer Science Logic, Lecture Notes in Computer Science, Springer, Berlin, 1994.
18. M. Hofmann, A simple model for quotient types, in: Proceedings of Typed Lamda Calculus and Applications, Lecture Notes in Computer Science, Vol. 902, Springer, Berlin, 1995 pp. 216-234.
19. Hyland J.M.E. The effective topos. Troelstra A.S., van Dalen D. The L.E.J. Brouwer Centenary Symp. Studies in Logic and The Foundations of Mathematics. Vol. 110:1982;165-216 North-Holland, Amsterdam.
20. Hyland J.M.E., Johnstone P.T., Pitts A.M. Tripos theory. Math. Proc. Cambridge Philos. Soc. 88:1980;205-232.
21. Hyland J.M.E., Pitts A.M. The theory of constructions: categorical semantics and topos theoretical models. Gray J.W., Scedrov A. Categories in Computer Science and Logic. Contemporary Mathematics. Vol. 92:1989;137-199 American Mathematical Society, Providence, RI.
22. Hyland J.M.E., Robinson E.P., Rosolini G. The discrete objects in the effective topos. Proc. London Math. Soc. 3(60):1990;1-36.
23. B. Jacobs, Categorical type theory, Ph.D. Thesis, University of Nijmegen, 1991.
24. B. Jacobs, Quotients in simple type theory, unpublished Manuscript, available at http://www.cwi.nl/~bjacobs/drafts.html, June 1991.
25. Jacobs B. Comprehension categories and the semantics of type dependency. Theoret. Comput. Sci. 107:1993;169-207.
26. Jacobs B. Categorical Logic and Type Theory. 1999;Elsevier Science, Amsterdam.
27. S.C. Kleene, Countable functionals, in: A. Heyting (Ed.), Constructivity in Mathematics, Proc. of the Colloquium, Amsterdam, 1957, North-Holland, Amsterdam, 1959, pp. 81-100.
28. J.R. Longley, Realizability toposes and language semantics, Ph.D. Thesis, University of Edinburgh, 1994.
29. Luo Z. Computation and Reasoning, A Type Theory for Computer Science. International Series of Monographs on Computer Science. Vol. 11:1994;Oxford University Press, Oxford.
30. Moggi E. A category theoretic account of program modules. Math. Struct. Comput. Sci. 1:1991;103-139.
31. E. Moggi, Metalanguages and applications, Notes for Summer School on Semantics and Logics of Computation, University of Cambridge, Isaac Newton Institute for Mathematical Sciences, September 1995.
32. D. Pavlović, Predicates and fibrations, Ph.D. Thesis, University of Utrect, 1990.
33. W. Phoa, An introduction to fibrations, topos theory, the effective topos and modest sets, Tech. Report, University of Edinburgh, 1993.
34. A.M. Pitts, Categorical logic, unpublished manuscript, available at http://hypatia.dcs.qmw.ac.uk/authors/P/PittsAM/, May 1995.
35. B. Reus, Program verification in synthetic domain theory, Ph.D. Thesis, Ludwig-Maximilians-Universität München, November 1995.
36. Robinson E.P., Rosolini G. Colimit completions and the effective topos. J. Symbolic Logic. 55:1990;678-699.
37. J. Rosický, Cartesian closed exact completions, available from the Hypatia Electronic Library: http://hypatia.dcs.qmw.ac.uk, 1997.
38. D.S. Scott, A new category? unpublished manuscript, available at http://www.cs.cmu.edu/Groups/LTC/ .
39. Stoltenberg-Hansen V., Lindström I., Griffor E.R. Mathematical Theory of Domains. Cambridge Tracts in Computer Science. Vol. 22:1994;Cambridge University Press, Cambridge.
40. P. Taylor, Recursive domains, indexed categories and polymorphism, Ph.D. Thesis, University of Cambridge, 1986.