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

Authors:
Herman Geuvers;Erik Barendsen
Affiliations:
Computing Science Department, Eindhoven University of Technology, NL and Computing Science Department, Nijmegen University, NL;Computing Science Department, Nijmegen University, NL
Venue:
Mathematical Structures in Computer Science
Year:
1999

Citing 7
Cited 2

Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
The calculus of constructions

Information and Computation - Semantics of Data Types
An algorithm for testing conversion in type theory

Logical frameworks
A framework for defining logics

Journal of the ACM (JACM)
The Undecidability of Typability in the Lambda-Pi-Calculus

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A short and flexible proof of Strong Normalization for the Calculus of Constructions

TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Constructions: A Higher Order Proof System for Mechanizing Mathematics

EUROCAL '85 Invited Lectures from the European Conference on Computer Algebra-Volume I - Volume I

On equivalence and canonical forms in the LF type theory

ACM Transactions on Computational Logic (TOCL)
Mechanizing the metatheory of LF

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

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.