Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Proof Irrelevance and Strict De nitions in a Logical Framework
 

Summary: Proof Irrelevance and Strict De nitions in a
Logical Framework
Jason Reed
May 3, 2002
Abstract
The addition of proof irrelevant types to LF permits more expres-
sive encodings and a richer (but still decidable) de nitional equality. It
can also be used to maintain invariants concerning the replacability of
subproofs of large proofs, which can be useful for proof compression for
proof-carrying code. We investigate the metatheoretic properties of this
language extension and reconcile it with the notion of strictness, a prop-
erty of notational de nitions which can improve implementation e∆ciency
of proofchecking.
Contents
1 Introduction 2
1.1 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.2 Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2 Preliminaries 3
2.1 Logic and Representation . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 Dependent Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University
Pfenning, Frank - School of Computer Science, Carnegie Mellon University

 

Collections: Computer Technologies and Information Sciences; Mathematics