Dependent record types revisited

Authors:
Zhaohui Luo
Affiliations:
University of London, Surrey, U.K.
Venue:
Proceedings of the 1st Workshop on Modules and Libraries for Proof Assistants
Year:
2009

Citing 5
Cited 0

Programming in Martin-Lo¨f's type theory: an introduction

Programming in Martin-Lo¨f's type theory: an introduction
A type-theoretic approach to higher-order modules with sharing

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computation and reasoning: a type theory for computer science

Computation and reasoning: a type theory for computer science
The Metatheory of UTT

TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
A Logical Framework with Dependently Typed Records

Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dependently-typed records have been studied in type theory in several previous research attempts, with applications to the study of module mechanisms for both programming and proof languages. Recently, the author has proposed an improved formulation of dependent record types in the context of studying manifest fields of module types. In this paper, we study this formulation in more details by considering universes of record types and some application examples. In particular, we show that record types provide a more powerful mechanism (than record kinds) in expressing module types and additional useful means (as compared with Σ-types) in applications.