Type-Theory in Color
Paper in proceedings, 2013

Dependent-type theory is on the verge of becoming the standard way to formalise mathematics at the same time as displace traditional platforms for high-insurance programming. However, current implementations of type theory are still lacking, in the sense that obvious truths are simply impossible to prove, making type-theory awkward to use for many applications, both in formalisation or programming. In particular, notions of erasure are poorly supported. In this paper we propose to conservatively extend type-theory with colored terms, color erasure and color selection. 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

Author

Jean-Philippe Bernardy

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Guilhem Moulin

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

18th ACM SIGPLAN International Conference on Functional Programming, ICFP 2013; Boston, MA; United States; 25 September 2013 through 27 September 2013

61-71

Subject Categories

Algebra and Logic

Computer Science

Areas of Advance

Information and Communication Technology

Roots

Basic sciences

DOI

10.1145/2500365.2500577

ISBN

978-145032326-0

More information

Created

10/8/2017