A. Abel, Semi-continuous Sized Types and Termination, 1?33, pp.310-2168, 2008.
DOI : 10.1007/11874683_5
URL : http://arxiv.org/abs/0804.0876

A. Abel, Towards Normalization by Evaluation for the ????-Calculus of Constructions, Functional and Logic Programming, 10th International Symposium, FLOPS 2010, pp.224-239978, 2010.
DOI : 10.1007/978-3-642-12251-4_17

A. Abel, Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types, Proceedings of the 8th Workshop on Fixed Points in Computer ScienceElectronic Proceedings in Theoretical Computer Science), 2012.
DOI : 10.4204/EPTCS.77.1
URL : http://arxiv.org/abs/1202.3496

A. Abel, Normalization by Evaluation: Dependent Types and Impredicativity. Unpublished, 2013.
DOI : 10.1145/3110277

A. Abel and T. Altenkirch, A predicative analysis of structural recursion, Journal of Functional Programming, vol.12, issue.01, 2002.
DOI : 10.1017/S0956796801004191

A. Abel, T. Coquand, and P. Dybjer, Normalization by Evaluation for Martin-Löf Type Theory with Typed Equality Judgements, 22nd IEEE Symposium on Logic in Computer Science, pp.10-12, 2007.
DOI : 10.1109/lics.2007.33

A. Abel, T. Coquand, and M. Pagano, A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance, Typed Lambda Calculi and Applications, 9th International Conference Proceedings (Lecture Notes in Computer Science), pp.5-19978, 2009.

A. Abel, T. Coquand, and M. Pagano, A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance, Logical Methods in Computer Science, vol.7, issue.12, pp.74-2011, 2011.

A. Abel and B. Pientka, Abstract, Journal of Functional Programming, vol.4, p.61, 2016.
DOI : 10.1023/A:1019916231463

A. Abel and G. Scherer, On Irrelevance and Algorithmic Equality in Predicative Type Theory, 1?36, pp.2910-2168, 2012.
DOI : 10.2168/LMCS-8(1:29)2012

. Agdateam, The Agda Wiki, 2017.

R. M. Amadio, Foundations of Software Science and Computational Structures Held as Part of the Joint European Conferences on Theory and Practice of Software, 11th International Conference, 2008.

M. Roberto, S. Amadio, and . Coupet, Analysis of a Guard Condition in Type Theory (Extended Abstract), Foundations of Software Science and Computation Structure, First International Conference, FoSSaCS'98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98 Proceedings (Lecture Notes in Computer Science), Maurice Nivat, pp.48-62, 1998.

H. Barendregt, Introduction to Generalized Type Systems, Journal of Functional Programming, vol.1, issue.2, pp.125-154, 1991.

B. Barras and B. Bernardo, The Implicit Calculus of Constructions as a Programming Language with Dependent Types, See, 2008.

G. Barthe, M. J. Frade, E. Giménez, L. Pinto, and T. Uustalu, Type-based termination of recursive definitions, Mathematical Structures in Computer Science, vol.14, issue.1, 2004.
DOI : 10.1017/S0960129503004122

G. Barthe, B. Grégoire, and F. Pastawski, CIC?: Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions, Logic for Programming 13th International Conference Proceedings (Lecture Notes in Computer Science), pp.257-271, 2006.

G. Barthe, B. Grégoire, and C. Riba, A Tutorial on Type-Based Termination, LerNet ALFA Summer School, pp.978-981, 2008.
DOI : 10.1023/A:1019916231463
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.596.600

G. Barthe, B. Grégoire, and C. Riba, Type-Based Termination with Sized Products, Computer Science Logic, 22nd International Workshop Proceedings (Lecture Notes in Computer Science), pp.493-507978, 2008.
DOI : 10.1007/978-3-540-87531-4_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.544.847

U. Berger and H. Schwichtenberg, An inverse of the evaluation functional for typed lambda -calculus, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, p.151645, 1991.
DOI : 10.1109/LICS.1991.151645

F. Blanqui, A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems, Rewriting Techniques and Applications, 15th International Conference Proceedings (Lecture Notes in Computer Science), pp.24-39978, 2004.
DOI : 10.1007/978-3-540-25979-4_2
URL : https://hal.archives-ouvertes.fr/inria-00100254

F. Blanqui, Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations, Computer Science Logic, 19th International Workshop, CSL 2005 Proceedings (Lecture Notes in Computer Science), pp.135-150, 2005.
DOI : 10.1007/11538363_11
URL : https://hal.archives-ouvertes.fr/inria-00000200

F. Blanqui and C. Riba, Combining Typing and Size Constraints for Checking the Termination of Higher- Order Conditional Rewrite Systems, Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference Proceedings (Lecture Notes in Computer Science), pp.105-119, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00084837

A. Bove, Another Look at Function Domains, Electronic Notes in Theoretical Computer Science, vol.249, pp.61-74, 2009.
DOI : 10.1016/j.entcs.2009.07.084
URL : http://doi.org/10.1016/j.entcs.2009.07.084

A. Bove and V. Capretta, Modelling general recursion in type theory, Mathematical Structures in Computer Science, vol.15, issue.4, 2005.
DOI : 10.1017/S0960129505004822

E. Brady, Idris, a general-purpose dependently typed programming language: Design and implementation, Journal of Functional Programming, vol.36, issue.05, 2013.
DOI : 10.1017/S0956796803004829

T. Coquand, An algorithm for type-checking dependent types, Mathematics of Program Construction. Selected Papers from the Third International Conference on the Mathematics of Program Construction, pp.167-642300021, 1995.
DOI : 10.1016/0167-6423(95)00021-6
URL : http://doi.org/10.1016/0167-6423(95)00021-6

O. Danvy, Type-Directed Partial Evaluation, DIKU 1998 International Summer School, pp.367-411, 1998.
DOI : 10.1145/289423.289458
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.291

G. De-bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, Indagationes Mathematicae, vol.34, pp.381-392, 1972.

P. Dybjer, Abstract, The Journal of Symbolic Logic, vol.49, issue.02, 2000.
DOI : 10.1017/CBO9780511569807.011

D. Fridlender and M. Pagano, A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation, Typed Lambda Calculi and Applications, 11th International Conference Proceedings (Lecture Notes in Computer Science), pp.140-155978, 2013.

H. Geuvers, A short and flexible proof of Strong Normalization for the Calculus of Constructions, See [Dybjer et al. 1995], 14?38. https, 1994.

E. Giménez, Codifying Guarded Definitions with Recursive Schemes, See [Dybjer et al. 1995], 39?59. https: //doi, 1995.

B. Grégoire and X. Leroy, A compiled implementation of strong reduction, Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming, 2002.

B. Grégoire and J. L. Sacchini, On Strong Normalization of the Calculus of Constructions with Type-Based Termination, Logic for Programming, Artificial Intelligence, and Reasoning -17th International Conference Proceedings (Lecture Notes in Computer Science), pp.333-347978, 2010.
DOI : 10.1007/BFb0097796

R. Harper and F. Pfenning, On equivalence and canonical forms in the LF type theory, 61?101, 2005.
DOI : 10.1145/1042038.1042041

P. Gérard and . Huet, The Constructive Engine In A Perspective in Theoretical Computer Science -Commemorative Volume for Gift Siromoney, World Scientific Series in Computer Science, vol.16, 1989.

J. Hughes, L. Pareto, and A. Sabry, Proving the correctness of reactive systems using sized types, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.410-423, 1996.
DOI : 10.1145/237721.240882

U. Dal, L. , C. Neil, D. Jones, M. Amir et al., Held as Part of the European Joint Conferences on Theory and Practice of Software The Size-Change Principle for Program Termination, Probabilistic Termination by Monadic Affine Sized Typing. In Programming Languages and Systems -26th European Symposium on Programming Proceedings (Lecture Notes in Computer Science) Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001.

W. Lovas and F. Pfenning, Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance, Logical Methods in Computer Science, vol.6, issue.4, 2010.
DOI : 10.2168/LMCS-6(4:5)2010
URL : https://lmcs.episciences.org/1063/pdf

P. Martin-löf, An Intuitionistic Theory of Types: Predicative Part, Logic Colloquium '73, 1975.
DOI : 10.1016/S0049-237X(08)71945-1

A. Miquel, A model for impredicative type systems, universes, intersection types and subtyping, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), p.855752, 2000.
DOI : 10.1109/LICS.2000.855752
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.23.6698&rep=rep1&type=pdf

A. Miquel, The Implicit Calculus of Constructions, Typed Lambda Calculi and Applications, 5th International Conference Proceedings (Lecture Notes in Computer Science), Samson Abramsky, 2001.

N. Mishra-linger and T. Sheard, Erasure and Polymorphism in Pure Type Systems, See, 2008.
DOI : 10.1007/978-3-540-78499-9_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.2558

B. Nordström, Terminating general recursion, BIT, vol.24, issue.3, pp.605-619, 1988.
DOI : 10.1007/BF01941137

U. Norell, Towards a Practical Programming Language Based on Dependent Type Theory, 2007.

F. Pfenning, Intensionality, extensionality, and proof irrelevance in modal type theory, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.16-19932499, 2001.
DOI : 10.1109/LICS.2001.932499
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.28.5884&rep=rep1&type=pdf

J. L. Sacchini, Type-Based Productivity of Stream Definitions in the Calculus of Constructions, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013.
DOI : 10.1109/LICS.2013.29

J. L. Sacchini, Linear Sized Types in the Calculus of Constructions, Functional and Logic Programming -12th International Symposium, FLOPS 2014, 2014.
DOI : 10.1007/978-3-319-07151-0_11

A. Stump, V. Sjöberg, and S. Weirich, Termination Casts: A Flexible Approach to Termination with General Recursion Satellite Workshop of ITP'10 at FLoC, Workshop on Partiality And Recursion in Interactive Theorem ProversElectronic Proceedings in Theoretical Computer Science), 2010.

M. Sulzmann, M. M. Chakravarty, S. L. Jones, and K. Donnelly, System F with type equality coercions, Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation , TLDI '07, pp.53-66, 2007.
DOI : 10.1145/1190315.1190324
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.2364

D. Wahlstedt, Dependent Type Theory with Parameterized First-Order Data Types and Well-Founded Recursion, 2007.

B. Werner, A Normalization Proof for an Impredicative Type System with Large Eliminations over Integers, Proceedings of the 1992 Workshop on Types for Proofs and Programs, 1992.

H. Xi, Dependent Types for Program Termination Verification, Journal of Higher-Order and Symbolic Computation, vol.15, issue.1, p.1019916231463, 2002.