• DocumentCode
    3223377
  • Title

    Intensionality, extensionality, and proof irrelevance in modal type theory

  • Author

    Pfenning, Frank

  • Author_Institution
    Dept. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    221
  • Lastpage
    230
  • Abstract
    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 α-conversion), extensionally (subject also to βη-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)
  • Keywords
    formal logic; functional programming; type theory; α-conversion; βη-conversion; 1st-order modal logics; consistency guarantee; definitional equalities; extensionality; functional programming; intensionally; judgmental concepts; logical frameworks; modal restrictions; modal type theory; object views; proof irrelevance; propositions; specifications; uniform type theory; Computer science; Functional programming; Heart; Logic programming;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 2001. Proceedings. 16th Annual IEEE Symposium on
  • Conference_Location
    Boston, MA
  • ISSN
    1043-6871
  • Print_ISBN
    0-7695-1281-X
  • Type

    conf

  • DOI
    10.1109/LICS.2001.932499
  • Filename
    932499