Hostname: page-component-7c8c6479df-8mjnm Total loading time: 0 Render date: 2024-03-29T07:28:25.646Z Has data issue: false hasContentIssue false

Some logical and syntactical observations concerning the first-order dependent type system λP

Published online by Cambridge University Press:  01 August 1999

HERMAN GEUVERS
Affiliation:
Computing Science Department, Eindhoven University of Technology, NL and Computing Science Department, Nijmegen University, NL
ERIK BARENDSEN
Affiliation:
Computing Science Department, Nijmegen University, NL

Abstract

We look at two different ways of interpreting logic in the dependent type system λP. The first is by a direct formulas-as-types interpretation à la Howard where the logical derivation rules are mapped to derivation rules in the type system. The second is by viewing λP as a Logical Framework, following Harper et al. (1987) and Harper et al. (1993). The type system is then used as the meta-language in which various logics can be coded.

We give a (brief) overview of known (syntactical) results about λP. Then we discuss two issues in some more detail. The first is the completeness of the formulas-as-types embedding of minimal first-order predicate logic into λP. This is a remarkably complicated issue, a first proof of which appeared in Geuvers (1993), following ideas in Barendsen and Geuvers (1989) and Swaen (1989). The second issue is the minimality of λP as a logical framework. We will show that some of the rules are actually superfluous (even though they contribute nicely to the generality of the presentation of λP).

At the same time we will attempt to provide a gentle introduction to λP and its various aspects and we will try to use little inside knowledge.

Type
Research Article
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)