Skip to main content
Log in

Dependently Typed Records in Type Theory

  • Original Paper
  • Published:
Formal Aspects of Computing

Abstract.

The language Pebble of Burstall and Lampson proposed dependent types as the underlying principle in a unified framework to explain facilities for programming in the large, such as modules and signatures, as well as for programming in the small. This proposal soon extended to large scale formal proof development as well. In fact, the functional approach to modularity has turned out to be a hard problem, which is still far from a fully satisfactory solution. This paper discusses aspects of this approach, including representations of records, informative signatures, sharing, and subtyping. My main contribution in this paper is to show that structures with dependent types and manifest fields (roughly ML style modules) are internally definable in a type theoretic framework extended with inductive-recursive definition. This shows that powerful modules follow from general principles without module-specific assumptions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received February 2002 / Accepted in revised form February 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pollack, R. Dependently Typed Records in Type Theory. Form Aspects Comput 13, 386–402 (2002). https://doi.org/10.1007/s001650200018

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001650200018

Navigation