LIPIcs.TYPES.2013.169.pdf
- Filesize: 458 kB
- 19 pages
Document
The Rooster and the Syntactic Bracket
Authors
-
Part of:
Volume:
19th International Conference on Types for Proofs and Programs (TYPES 2013)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Types for Proofs and Programs (TYPES) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2014-07-25
Cite AsGet BibTex
Hugo Herbelin and Arnaud Spiwack. The Rooster and the Syntactic Bracket. In 19th International Conference on Types for Proofs and Programs (TYPES 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 26, pp. 169-187, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/LIPIcs.TYPES.2013.169
https://doi.org/10.4230/LIPIcs.TYPES.2013.169
Abstract
We propose an extension of pure type systems with an algebraic presentation of inductive and co-inductive type families with proper indices. This type theory supports coercions toward from smaller sorts to bigger sorts via explicit type construction, as well as impredicative sorts. Type families in impredicative sorts are constructed with a bracketing operation. The necessary restrictions of pattern-matching from impredicative sorts to types are confined to the bracketing construct. This type theory gives an alternative presentation to the calculus of inductive constructions on which the Coq proof assistant is an implementation.
Keywords
- Coq
- Calculus of inductive constructions
- Impredicativity
- Strictly positive type families
- Inductive type families
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads