首页 | 本学科首页   官方微博 | 高级检索  
     


Modal Pure Type Systems
Authors:Tijn Borghuis
Affiliation:(1) Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Abstract:We present a framework for intensional reasoning in typed lambda-calculus. In this family of calculi, called Modal Pure Type Systems (MPTSs), a ldquopropositions-as-typesrdquo-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.
Keywords:Knowledge representation  natural deduction  normal modal logics  typed lambda-calculus" target="_blank">gif" alt="lambda" align="BASELINE" BORDER="0">-calculus
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号