Intensionality, extensionality, and proof irrelevance in modal type theory

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 221-230

  Pfenning, F ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; MATHEMATICAL MODELS; MODAL ANALYSIS; SET THEORY; THEOREM PROVING;

FUNCTIONAL PROGRAMMING; MODAL LOGIC; TYPE THEORY;

PROGRAMMING THEORY;

EID: 0034864194     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Type-based useless-code elimination for functional programs
2. Refined program extraction from classical proofs
3. A linear logical framework
4. A modal analysis of staged computation
5. The coq proof assistant user's guide
6. A framework for defining logics
7. On equivalence and canonical forms in the LF type theory
8. Logic programming in a fragment of intuitionistic linear logic
9. Analytic and synthetic judgements in type theory
10. On the meanings of the logical constants and the justifications of the logical laws
11. Proof-carrying code
12. Efficient representation and validation of logical proofs
13. Oracle-based checking of untrusted software
14. Intensionality, extensionality, and proof irrelevance in modal type theory
15. A judgemental reconstruction of modal logic
16. System description: Twelf - a meta-logical framework for deductive systems
17. Mode and termination checking for higher-order logic programs
18. Generating proofs from a decision procedure