Abstract
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.
Supplemental Material
Available for Download
Appendix B (proof details).
- M. Abadi, A. Banerjee, N. Heintze, and J. Riecke. A core calculus of dependency. In POPL'99, pages 147--160. ACM, 1999. Google Scholar
Digital Library
- A. Abel and G. Scherer. On irrelevance and algorithmic equality in predicative type theory. Logical Methods in Comp. Sci., 8(1):1--36, 2012. TYPES'10 special issue.Google Scholar
Cross Ref
- H. P. Barendregt. Lambda calculi with types. Handbook of logic in computer science, 2:117--309, 1992. Google Scholar
Digital Library
- J.-P. Bernardy and M. Lasson. Realizability and parametricity in pure type systems. In M. Hofmann, editor, FoSSaCS, volume 6604 of LNCS, pages 108--122. Springer, 2011. Google Scholar
Digital Library
- J.-P. Bernardy and G. Moulin. A computational interpretation of parametricity. In Proc. of the Symposium on Logic in Comp. Sci. IEEE, 2012. Google Scholar
Digital Library
- J.-P. Bernardy, P. Jansson, and R. Paterson. Parametricity and dependent types. In Proc. of ICFP 2010, pages 345--356, Baltimore, Maryland, 2010. ACM. Google Scholar
Digital Library
- J.-P. Bernardy, P. Jansson, and R. Paterson. Proofs for free-parametricity for dependent types. J. Funct. Program., 22(02):107--152, 2012. Google Scholar
Digital Library
- T. Coquand and G. Huet. The calculus of constructions. Technical report, INRIA, 1986.Google Scholar
- P.-E. Dagand and C. McBride. Transporting functions across ornaments. In Proc. of ICFP 2012, ICFP '12, New York, NY, USA, 2012. ACM. Google Scholar
Digital Library
- D. Licata and R. Harper. Canonicity for 2-dimensional type theory. In Proc. of POPL 2012. ACM, 2012. Google Scholar
Digital Library
- P. Martin-Lof. Intuitionistic type theory. Bibliopolis, 1984.Google Scholar
- N. Mishra-Linger and T. Sheard. Erasure and polymorphism in pure type systems. In FoSSaCS 2008, pages 350--364. Springer-Verlag, 2008. Google Scholar
Digital Library
- U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers Tekniska Hogskola, 2007. URL http://publications.lib.chalmers.se/cpl/record/index.xsql?pubid=46311.Google Scholar
- C. Paulin-Mohring. Extracting F!'s programs from proofs in the calculus of constructions. In POPL'89, pages 89--104. ACM, 1989. ISBN 0-89791-294-2. Google Scholar
Digital Library
- F. Pfenning. Intensionality, extensionality, and proof irrelevance in modal type theory. In Proc. 16th Annual IEEE Symposium on Logic in Comp. Sci., pages 221--230. IEEE, 2001. ISBN 0-7695-1281-X. URL http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=932499. Google Scholar
Digital Library
- V. Siles. Investigation on the typing of equality in type systems. Phd thesis, Ecole Polytechnique, 2010.Google Scholar
- The Coq development team. The Coq proof assistant, 2012. URL http://coq.inria.fr.Google Scholar
- P. Wadler. Call-by-value is dual to call-by-name. In Proc. of ICFP 2003, ICFP '03, pages 189--201, New York, NY, USA, 2003. ACM. ISBN 1-58113-756-7. . URL http://doi.acm.org/10.1145/944705.944723. Google Scholar
Digital Library
- P. Wadler. The Girard-Reynolds isomorphism (second edition). Theor. Comp. Sci., 375(1-3):201--226, 2007. Google Scholar
Digital Library
- P.Wadler. Propositions as sessions. In Proc. of ICFP 2012, ICFP '12, pages 273--286, New York, NY, USA, 2012. ACM. Google Scholar
Digital Library
Index Terms
Type-theory in color
Recommendations
Type-theory in color
ICFP '13: Proceedings of the 18th ACM SIGPLAN international conference on Functional programmingDependent 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 ...
Parametric quantifiers for dependent type theory
Polymorphic type systems such as System F enjoy the parametricity property: polymorphic functions cannot inspect their type argument and will therefore apply the same algorithm to any type they are instantiated on. This idea is formalized mathematically ...
Type-preserving CPS translation of Σ and Π types is not not possible
Dependently typed languages such as Coq are used to specify and prove functional correctness of source programs, but what we ultimately need are guarantees about correctness of compiled code. By preserving dependent types through each compiler pass, we ...







Comments