A cartesian closed category in Martin-Löf's intuitionistic type theory

Theoretical Computer Science

Volumn 290, Issue 1, 2003, Pages 189-219

  Valentini, Silvio ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Cartesian closed categories; Intuitionistic type theory; Scott domains

Indexed keywords

COMPUTER SIMULATION; FORMAL LOGIC; MATHEMATICAL MODELS; SEMANTICS; SET THEORY;

CARTESIAN CLOSED CATEGORIES;

COMPUTER SCIENCE;

EID: 0037209716     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00309-7     Document Type: Article

References (12)

1. R. Backhouse, P. Chisholm, G. Malcom, E. Saaman, Do-it-yourself Type Theory, Formal Aspects of Computing, vol. 1, 1989, pp. 19-84.
2. Barendregt H. The Lambda Calculus, its Syntax and Semantics, Studies in Logic and Foundations of Mathematics. 1984;North-Holland, Amsterdam.
3. Maietti M.E. About effective quotients in constructive type theory. Altenkirch T., Naraschewski W., Reus B. Types for Proofs and Programs, International Workshop "Types'98" Lecture Notes in Computer Science. vol. 1657:1999;164-178 Springer, Berlin.
4. Martin-Löf P. Intuitionistic Type Theory, notes by G. Sambin of a series of lectures given in Padua. 1984;Bibliopolis, Naples.
5. Nordström B., Peterson K., Smith J. Programming in Martin-Löf's Type Theory, An introduction. 1990;Clarendon Press, Oxford.
6. Sambin G. Intuitionistic formal spaces - a first communication. Skordev D. Mathematical Logic and its Applications. 1987;187-204 Plenum Press, New York.
7. Sambin G., Valentini S. Building up a tool-box for Martin-Löf intuitionistic type theory. Sambin G., Smith J. Twenty-five Years of Constructive Type Theory. Oxford Logic Guides. vol. 36:1998;221-244 Oxford University Press, New York.
8. Sambin G., Valentini S., Virgili P. Constructive domain theory as a branch of Intuitionistic Pointfree Topology. Theoret. Comput. Sci. 159:1996;319-341.
9. D.S. Scott, Lectures on a mathematical theory of computation, Oxford University Computing Laboratory Technical Monograph PRG-19, 1981.
10. Scott D.S. Domains for denotational semantics. Nielsen M., Schmidt E.M. Automata, Languages and Programming. 1982;577-613 Springer, Berlin.
11. Valentini S. Decidability in Intuitionistic Theory of Types is functionally decidable. Math. Logic Quart. 42:1996;300-304.
12. Valentini S. Extensionality versus Constructivity. Mathematical Logic Quart. 48(2):2002;179-187.