Hostname: page-component-7c8c6479df-27gpq Total loading time: 0 Render date: 2024-03-28T23:48:49.150Z Has data issue: false hasContentIssue false

Type checking dependent (record) types and subtyping

Published online by Cambridge University Press:  01 March 2000

GUSTAVO BETARTE
Affiliation:
Instituto de Computación, Universidad de la República, Montevideo, Uruguay (e-mail: gustun@fing.edu.uy)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this work we put forward an algorithm for the mechanical verification of an extension of Martin-Löf's theory of types with dependent record types and subtyping. We first give a concise description of that theory and motivate its use for the formalization of algebraic constructions. Then we concentrate on the informal explanation and specification of a proof checker that we have implemented. The logical heart of this proof checker is a type checking algorithm for the forms of judgement of a particular formulation of the extended theory which incorporates a notion of parameter. The algorithm has been proven sound with respect to the latter calculus. We include a discussion on that proof in the present work.

Type
Research Article
Copyright
© 2000 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.