The Rooster and the Syntactic Bracket - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

The Rooster and the Syntactic Bracket


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 re-strictions 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 con-structions on which the Coq proof assistant is an implementation.
Fichier principal
Vignette du fichier
syntactic_bracket.pdf (458.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01097919 , version 1 (22-12-2014)





Hugo Herbelin, Arnaud Spiwack. The Rooster and the Syntactic Bracket. 19th International Conference on Types for Proofs and Programs (TYPES 2013), Jul 2014, Toulouse, France. pp.169--187, ⟨10.4230/LIPIcs.TYPES.2013.169⟩. ⟨hal-01097919⟩
171 View
44 Download



Gmail Facebook Twitter LinkedIn More