5 citations found. Retrieving documents...
P. Martin-Lof. An intuitionistic theory of types. In G. Sambin and J. Smith, editors, Twenty-Five Years of Constructive Type Theory. Oxford University Press, August 1998. Proceedings of a Congress held in Venice, Italy, October 1995.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Formalising Strong Normalisation Proofs of Explicit.. - Kamareddine, Qiao (2002)   (Correct)

....[ De ne the function T : s by: T (n) n T (ab) T (a)T (b) T ( a) T (a) s ki ] T ( a) T (a) T (a b) T (a) T (b) i ] THEOREM 32. If a s b then T (a) T (b) 4. The proof assistant ALF 4.1. About Martin L of s Type Theory In Martin L of s type theory [25] predicate logic is interpreted within type theory through Pat, the Curry Howard de Bruijn interpretation of propositions as types (sets) A proposition is interpreted as a set whose elements represent the proofs of the proposition. Hence, a false proposition is interpreted as the empty set and a ....

P. Martin-Lof. An intuitionistic theory of types. Logic Colloquium '73, 1975.


Indexed Induction-Recursion - Dybjer, Setzer (2001)   (Correct)

....IIR which we will give later. 3.2 Indexed Inductive Recursive De nitions Martin L of s computability predicates for dependent types. We shall now turn to proper IIR. As a rst example we shall formalize the Tait style computability predicates for dependent types introduced by Martin L of [17]. This example was crucial for the historical development of IIR, since it may be viewed as an early occurrence of the informal notion of an IIR. In [17] Martin L of presents an early version of his intuitionistic type theory and proves a normalization theorem using such Tait style computability ....

....turn to proper IIR. As a rst example we shall formalize the Tait style computability predicates for dependent types introduced by Martin L of [17] This example was crucial for the historical development of IIR, since it may be viewed as an early occurrence of the informal notion of an IIR. In [17] Martin L of presents an early version of his intuitionistic type theory and proves a normalization theorem using such Tait style computability predicates. He works in an informal intuitionistic metalanguage but gives no explicit justi cation for the meaningfulness of these computability ....

[Article contains additional citation context not shown here]

P. Martin-Lof. An intuitionistic theory of types. In G. Sambin and J. Smith, editors, Twenty-Five Years of Constructive Type Theory. Oxford University Press, 1998. Reprinted version of an unpublished report from 1972.


Propositions as [Types] - Awodey, Bauer (2001)   (1 citation)  (Correct)

No context found.

P. Martin-Lof. An intuitionistic theory of types. In G. Sambin and J. Smith, editors, Twenty-Five Years of Constructive Type Theory. Oxford University Press, August 1998. Proceedings of a Congress held in Venice, Italy, October 1995.


Propositions as [Types] - Awodey, Bauer (2001)   (1 citation)  (Correct)

No context found.

P. Martin-Lof. An intuitionistic theory of types. In G. Sambin and J. Smith, editors, Twenty-Five Years of Constructive Type Theory. Oxford University Press, August 1998. Proceedings of a Congress held in Venice, Italy, October 1995.


Indexed Induction-Recursion - Peter Dybjer And (2001)   (Correct)

No context found.

P. Martin-Lof. An intuitionistic theory of types. In G. Sambin and J. Smith, editors, Twenty-Five Years of Constructive Type Theory. Oxford University Press, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC