Modal Pure Type Systems

Authors:
Tijn Borghuis
Affiliations:
Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands (E-mail: tijn@win.tue.nl)
Venue:
Journal of Logic, Language and Information
Year:
1998

Citing 3
Cited 2

Types in lambda calculi and programming languages (invited lecture)

Proceedings of the third European symposium on programming on ESOP '90
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Communication Contexts: a Pragmatic Approach to Information Exchange

TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs

Parameters in Pure Type Systems

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Pure type systems with corecursion on streams: from finite to infinitary normalisation

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a framework for intensional reasoning in typedλ-calculus. In this family of calculi, called Modal Pure TypeSystems (MPTSs), a ’’propositions-as-types‘‘-interpretation can be givenfor normal modal logics. MPTSs are an extension of the Pure TypeSystems (PTSs) of Barendregt (1992). We show that they retainthe desirable meta-theoretical properties of PTSs, and briefly discussapplications in the area of knowledge representation.