Termination and Productivity Checking with Continuous Types, Proc. of TLCA'03 ,
DOI : 10.1007/3-540-44904-3_1
Termination checking with types, RAIRO - Theoretical Informatics and Applications, vol.38, issue.4, pp.277-319, 2004. ,
DOI : 10.1051/ita:2004015
Type-based termination of recursive definitions, Mathematical Structures in Computer Science, vol.14, issue.1, pp.97-141, 2004. ,
DOI : 10.1017/S0960129503004122
Practical Inference for Type-Based Termination in a Polymorphic Setting, Proc. of TLCA'05 ,
DOI : 10.1007/11417170_7
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations, Proc. of CSL'05 ,
DOI : 10.1007/11538363_11
URL : https://hal.archives-ouvertes.fr/inria-00000200
Rewriting Modulo in Deduction Modulo, Proc. of RTA'03 ,
DOI : 10.1007/3-540-44881-0_28
URL : https://hal.archives-ouvertes.fr/inria-00105625
Termination and Confluence of Higher-Order Rewrite Systems, Proc. of RTA'00 ,
DOI : 10.1007/10721975_4
URL : https://hal.archives-ouvertes.fr/inria-00105556
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems, Proc. of RTA'04 ,
DOI : 10.1007/978-3-540-25979-4_2
URL : https://hal.archives-ouvertes.fr/inria-00100254
Definitions by rewriting in the Calculus of Constructions, Mathematical Structures in Computer Science, vol.15, issue.1, pp.37-92, 2005. ,
DOI : 10.1017/S0960129504004426
URL : https://hal.archives-ouvertes.fr/inria-00105568
On the Confluence of ??-Calculus with Conditional Rewriting, Proc. of FoSSaCS'06 ,
DOI : 10.1007/11690634_26
URL : https://hal.archives-ouvertes.fr/inria-00000729
Calculating sized types, Higher-Order and Symbolic Computation, vol.14, issue.2/3, pp.261-300, 2001. ,
DOI : 10.1023/A:1012996816178
Intersection types and computational effects, Proc. of ICFP'00 ,
Super-Exponential Complexity of Presburger Arithmetic, Proceedings of the SIAM-AMS Symposium in Applied Mathematics, 1974. ,
DOI : 10.1007/978-3-7091-9459-1_5
On Girard's " Candidats de Réductibilité, 1990. ,
Proving the correctness of reactive systems using sized types, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96 ,
DOI : 10.1145/237721.240882
Combinatory reduction systems: introduction and survey, Theoretical Computer Science, vol.121, issue.1-2, pp.279-308, 1993. ,
DOI : 10.1016/0304-3975(93)90091-7
URL : http://doi.org/10.1016/0304-3975(93)90091-7
Higher-order rewrite systems and their confluence, Theoretical Computer Science, vol.192, issue.1, pp.3-29, 1998. ,
DOI : 10.1016/S0304-3975(97)00143-6
ber die vollst ndigkeit eines gewissen systems der arithmetik ganzer zahlen, in welchem die addition als einzige operation hervortritt, Sprawozdanie z I Kongresu Matematykow Krajow Slowcanskich, 1929. ,
A realizability interpretation of the theory of species, Proceedings of the 1972 Logic Colloquium, 1975. ,
DOI : 10.1007/BFb0064875
Comparing combinatory reduction systems and higher-order rewrite systems, Proc. of HOA'93 ,
DOI : 10.1007/3-540-58233-9_13
Dependent types in practical programming, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '99, 1998. ,
DOI : 10.1145/292540.292560
Dependent types for program termination verification, Higher-Order and Symbolic Computation, vol.15, issue.1, pp.91-131, 2002. ,
DOI : 10.1023/A:1019916231463