CIC $\widehat{~}$ : Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions-Reference-Cited by-同舟云学术

CIC $\widehat{~}$ : Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions

Published:2006 Issue: Volume: Page:257-271
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Barthe Gilles,Grégoire Benjamin,Pastawski Fernando

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11916277_18.pdf

Reference26 articles.

1. Abel, A.: Termination checking with types. RAIRO– Theoretical Informatics and Applications 38, 277–320 (2004)

2. Abel, A.: A Polymorphic Lambda-Calculus with Sized Higher-Order Types. PhD thesis, Ludwig-Maximilians-Universität München (2006)

3. Barendregt, H.: Lambda calculi with types. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 117–309. Oxford Science Publications (1992)

4. Barras, B.: Auto-validation d’un système de preuves avec familles inductives. PhD thesis, Université Paris 7 (1999)

5. Lecture Notes in Computer Science;G. Barthe,2006

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Practical and Sound Equality Tests, Automatically: Deriving eqType Instances for Jasmin’s Data Types with Coq-Elpi;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11

2. Is sized typing for Coq practical?;Journal of Functional Programming;2023

3. Up-to techniques using sized types;Proceedings of the ACM on Programming Languages;2018-01

4. Size-based termination of higher-order rewriting;Journal of Functional Programming;2018

5. Normalization by evaluation for sized dependent types;Proceedings of the ACM on Programming Languages;2017-08-29