Type-Theory In Color
Artikel i vetenskaplig tidskrift, 2013

Dependent type-theory aims to become the standard way to formalize mathematics at the same time as displacing traditional platforms for high-assurance programming. However, current implementations of type theory are still lacking, in the sense that some obvious truths require explicit proofs, making type-theory awkward to use for many applications, both in formalization and programming. In particular, notions of erasure are poorly supported. In this paper we propose an extension of type-theory with colored terms, color erasure and interpretation of colored types as predicates. The result is a more powerful type-theory: some definitions and proofs may be omitted as they become trivial, it becomes easier to program with precise types, and some parametricity results can be internalized.

erasure

type-theory

parametricity

Författare

Jean-Philippe Bernardy

Chalmers, Data- och informationsteknik, Programvaruteknik

Guilhem Moulin

Chalmers, Data- och informationsteknik, Datavetenskap

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

0362-1340 (ISSN)

Vol. 48 9 61-71

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1145/2544174.2500577

Mer information

Skapat

2017-10-07