Journal of Logic, Language and Information

, Volume 7, Issue 3, pp 265–296

Modal Pure Type Systems

  • Tijn Borghuis

DOI: 10.1023/A:1008254612284

Cite this article as:
Borghuis, T. Journal of Logic, Language and Information (1998) 7: 265. doi:10.1023/A:1008254612284


We present a framework for intensional reasoning in typed λ-calculus. In this family of calculi, called Modal Pure Type Systems (MPTSs), a “propositions-as-types”-interpretation can be given for normal modal logics. MPTSs are an extension of the Pure Type Systems (PTSs) of Barendregt (1992). We show that they retain the desirable meta-theoretical properties of PTSs, and briefly discuss applications in the area of knowledge representation.

Knowledge representation natural deduction normal modal logics typed λ-calculus 

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Tijn Borghuis
    • 1
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations