2002 · 106 citations · 16 references
HumanitiesComputer ScienceFormal MethodsLogicProgramming LanguagesFirst-order LogicModal LogicModal SemanticsModalityModel TheoryType SystemsProof IrrelevanceType Theory
We develop a uniform type theory that integrates intensionality, extensionality and proof irrelevance as judgmental concepts. Any object may be treated intensionally (subject only to /spl alpha/-conversion), extensionally (subject also to /spl beta//spl eta/-conversion), or as irrelevant (equal to any other object at the same type), depending on where it occurs. Modal restrictions developed by R. Harper et al. (2000) for single types are generalized and employed to guarantee consistency between these views of objects. Potential applications are in logical frameworks, functional programming and the foundations of first-order modal logics. Our type theory contrasts with previous approaches that, a priori, distinguished propositions (whose proofs are all identified - only their existence is important) from specifications (whose implementations are subject to some definitional equalities).
16
George C. Necula · 1997 · 1.8K citations
A modal analysis of staged computation
Rowan Davies, Frank Pfenning · Journal of the ACM · 2001 · 300 citations