Synthetic domain theory in type theory: Another logic of computable functions-Reference-Cited by-同舟云学术

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

Published:1996 Issue: Volume: Page:363-380
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Reus Bernhard

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0105416

Reference19 articles.

1. S. Agerholm. A HOL Basis for Reasoning about Functional Programs. PhD thesis, BRICS, 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.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Denotational semantics of recursive types in synthetic guarded domain theory;Mathematical Structures in Computer Science;2018-05-15

2. Partiality, State and Dependent Types;Lecture Notes in Computer Science;2011

3. General synthetic domain theory — A logical approach (extended abstract);Category Theory and Computer Science;1997