R. Atkey, . Johann, . Patricia, and N. Ghani, Refining Inductive Types, Logical methods in computer science, pp.10-2168, 2012.
DOI : 10.2168/LMCS-8(2:9)2012
URL : http://arxiv.org/abs/1205.2492

N. Benton, . Hur, . Chung-kil, A. J. Kennedy, and C. Mcbride, Strongly Typed Term Representations in Coq, Journal of Automated Reasoning, vol.14, issue.1, pp.141-159, 2012.
DOI : 10.1007/s10817-011-9219-0

J. Bernardy, . Guilhem, and . Moulin, Type-theory in color, Pages 61?72 of: International conference on functional programming, 2013.

J. Bernardy and M. Lasson, Realizability and Parametricity in Pure Type Systems, Pages 108?122 of: Foundations of software science and computation structures, 2011.
DOI : 10.1007/978-3-642-19805-2_8
URL : https://hal.archives-ouvertes.fr/hal-00589893

R. S. Bird, . De-moor, and . Oege, The Algebra of Programming, 1997.
DOI : 10.1007/978-3-642-61455-2_12

E. Brady and K. Hammond, Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation. Pages 297?308 of: International conference in functional programming, 2010.

E. Brady, . Mcbride, . Conor, and J. Mckinna, Inductive families need not store their indices. Types for proofs and programs, 2003.

J. Chapman, P. Dagand, . Evariste, . Mcbride, . Conor et al., The gentle art of levitation, Pages 3?14 of: International conference on functional programming, 2010.

J. Cheney and R. Hinze, First-class phantom types, 2003.

P. Dagand, Reusability and dependent types, 2013.

. Dagand, . Pierre-evariste, and C. Mcbride, Transporting functions across ornaments, Pages 103?114 of: International conference on functional programming, 2012.
DOI : 10.1145/2364527.2364544
URL : https://hal.archives-ouvertes.fr/hal-00922581

. Dagand, . Pierre-evariste, and C. Mcbride, A categorical treatment of ornaments. Logics in computer science, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01081545

. Dagand, . Pierre-evariste, and C. Mcbride, Elaborating inductive definitions, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00778975

T. Freeman and F. Pfenning, Refinement types for ML. Pages 268?277 of: Programming language design and implementation, 1991.

C. Fumex, Induction and coinduction schemes in category theory, 2012.

G. Gonthier, . Mahboubi, . Assia, and E. Tassi, A Small Scale Reflection Extension for the Coq system, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00258384

C. Hermida and B. Jacobs, Structural induction and coinduction in a fibrational setting Information and computation, pp.107-152, 1998.

M. Hofmann and T. Streicher, The groupoid model refutes uniqueness of identity proofs. Pages 208?212 of: Logic in computer science, 1994.

. Ko, . Hsiang-shang, and J. Gibbons, Modularising inductive families, 2011.
DOI : 10.1145/2036918.2036921
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.252.3627

F. Lindblad, . Benke, and . Marcin, A tool for automated theorem proving in Agda. Pages 154?169 of: Types for proofs and programs, pp.10-1007, 2004.

C. Mcbride, Dependently typed functional programs and their proofs, 1999.

C. Mcbride, Elimination with a motive Page 727 of: Types for proofs and programs, 2002.

C. Mcbride, Ornamental algebras, algebraic ornaments, Journal of functional programming, 2013.

C. Mcbride and J. Mckinna, The view from the left, Journal of Functional Programming, vol.14, issue.1, pp.69-111, 2004.
DOI : 10.1017/S0956796803004829

C. Mcbride, . Goguen, . Healfdene, and J. Mckinna, A few constructions on constructors. Pages 186?200 of: Types for proofs and programs, pp.10-1007, 2004.

P. Morris, . Altenkirch, . Thorsten, and N. Ghani, A UNIVERSE OF STRICTLY POSITIVE FAMILIES, International Journal of Foundations of Computer Science, vol.20, issue.01, pp.83-107, 2009.
DOI : 10.1142/S0129054109006462

C. Paulin-mohring, Extraction de programmes dans le Calcul des Constructions, 1989.
URL : https://hal.archives-ouvertes.fr/tel-00431825

T. Schrijvers, P. Jones, . Simon, . Sulzmann, . Martin et al., Complete and decidable type inference for GADTs, Pages 341?352 of: International conference on functional programming, 2009.

P. Strub, Coq modulo theory. Pages 529?543 of: Computer science logic, 2010.
DOI : 10.1007/978-3-642-15205-4_40
URL : https://hal.archives-ouvertes.fr/inria-00497404

. Swamy, . Nikhil, . Chen, . Juan, . Fournet et al., Secure distributed programming with value-dependent types, Pages 266?278 of: International conference on functional programming, pp.10-1145, 2011.
DOI : 10.1145/2034773.2034811
URL : https://hal.archives-ouvertes.fr/hal-00939188

P. Wadler, Theorems for free! Pages 347?359 of: Conference on functional programming languages and computer architecture, 1989.