Synthetic domain theory in type theory: Another logic of computable functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1125, Issue , 1996, Pages 365-380

  Reus, Bernhard ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTABILITY AND DECIDABILITY; FORMAL LANGUAGES; SOFTWARE PROTOTYPING; THEOREM PROVING; VERIFICATION;

CALCULUS OF CONSTRUCTION; COMPUTABLE FUNCTIONS; FUNCTIONAL PROGRAMS; MACHINE-CHECKED PROOFS; MODULAR PROGRAMS; MODULAR SOFTWARES; PROOF CHECKERS; SYNTHETIC DOMAIN THEORY;

COMPUTER CIRCUITS;

EID: 84956858689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0105416     Document Type: Conference Paper

References (19)

1. S. Agerholm. A HOL Basis for Reasoning about Functional Programs. PhD thesis, BRJCS, University of Aarhus, 1994. Also available as BRICS report RS-94-44.
2. R. Burstall and J. McKinna. Deliverables: a categorical approach to program development in type theory. Technical Report ECS-LFCS-92-242, Edinburgh University, 1992.
3. Th. Coquand. An analysis of Girard's paradox. In Proc. 1st Symp. on Logic in Computer Science, pages 227-236. IEEE Computer Soc. Press, 1986.
4. P. Freyd, P. Mulry, G. Rosolini, and D. Scott. Extensional PERs. Information and Computation, 98:211-227, 1992.
5. P. Freyd. Algebraically complete categories. In A. Carboni, M.C. Pedicchio, and G. Rosolini, editors, Proceedings of the 1990 Como Category Theory Conference, volume 1488 of Lecture Notes in Mathematics, pages 95-104, Berlin, 1991. Springer.
6. J.M.E. Hyland. First steps in synthetic domain theory. In A. Carboni, M.C. Pedicchio, and G. Rosolini, editors, Proceedings of the 1990 Como Category Theory Conference, volume 1488 of Lecture Notes in Mathematics, pages 131-156, Berlin, 1991. Springer.
7. A. Kock. Synthetic Differential Geometry. Cambridge University Press, 1981.
8. Z. Luo and R. Pollack. Lego proof development system: User's manual. Technical Report ECS-LFCS-92-211, Edinburgh University, 1992.
9. J.R. Longley and A.K. Simpson. A uniform account of domain theory in realizability models. To be submitted to special edition of MSCS for the Workshop on Logic, Domains and Programming Languages, Darmstadt, Germany, 1995.
10. Z. Luo. Computation and Reasoning - A Type Theory for Computer Science, volume 11 of Monographs on Computer Science. Oxford University Press, 1994.
11. L.C. Paulson. Logic and Computation, volume 2 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1987.
12. W.K. Phoa. Domain Theory in Realizability Toposes. PhD thesis, University of Cambridge, 1990. Also available as report ECS-LFCS-91-171, University of Edinburgh.
13. F. Regensburger. HOLCF: Eine conservative Erweiterung von HOL um LCF. PhD thesis, Technische Universitat Miinchen, November 1994.
14. B. Reus. Program Verification in Synthetic Domain Theory. PhD thesis, Ludwig-Maximilians-Universitat Miinchen, 1995.
15. G. Rosolini. Continuity and effectiveness in topoi. PhD thesis, University of Oxford, 1986.
16. B. Reus and T. Streicher. Naive Synthetic Domain Theory - a logical approach. Draft, September 1993.
17. B. Reus and T. Streicher. Verifying properties of module construction in type theory. In A.M. Borzyszkowski and S. Sokotowski, editors, MFCS'93, volume 711 of Lecture Notes in Computer Science, pages 660-670. Springer, 1993.
18. T. Streicher. Semantics of Type Theory, Correctness, Completeness and Independence Results. Birkhauser, 1991.
19. P. Taylor. The fixed point property in synthetic domain theory. In 6th Symp. on Logic in Computer Science, pages 152-160, Washington, 1991. IEEE Computer Soc. Press.