Martin-Löf à la Coq-Reference-Cited by-同舟云学术

Martin-Löf à la Coq

Published:2024-01-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs
language:
Short-container-title:

Author:

Adjedj Arthur¹,Lennon-Bertrand Meven²,Maillard Kenji³,Pédrot Pierre-Marie³,Pujet Loïc⁴

Affiliation:

1. ENS Paris Saclay - Université Paris-Saclay, Saclay, France

2. University of Cambridge, Cambridge, UK

3. Inria, Nantes, France

4. Stockholm University, Stockholm, Sweden

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3636501.3636951

Reference17 articles.

1. Daniel Gratzer , Jonathan Sterling , and Lars Birkedal . 2019. Implementing a modal dependent type theoPryo.c. ACM Program. Lang., 3 , ICFP, Article 107, ( July 2019 ), 29 pages. do1i:0.1145/3341711. Daniel Gratzer, Jonathan Sterling, and Lars Birkedal. 2019. Implementing a modal dependent type theoPryo.c. ACM Program. Lang., 3, ICFP, Article 107, ( July 2019 ), 29 pages. do1i:0.1145/3341711.

2. Peter Hancock , Conor McBride , Neil Ghani , Lorenzo Malatesta , and Thorsten Altenkirch . 2013. Small induction recursion . In Typed Lambda Calculi and Applications. Masahito Hasegawa, (Ed.) Springer Berlin Heidelberg , Berlin, Heidelberg , 156-172. d1o0i. :10 07 /978-3-642-38946-7_13. Peter Hancock, Conor McBride, Neil Ghani, Lorenzo Malatesta, and Thorsten Altenkirch. 2013. Small induction recursion. In Typed Lambda Calculi and Applications. Masahito Hasegawa, (Ed.) Springer Berlin Heidelberg, Berlin, Heidelberg, 156-172. d1o0i. :10 07 /978-3-642-38946-7_13.

3. Jasper Hugunin . 2020 . Why not w? In26th International Conference on Types for Proofs and Programs, TYPES 2020 , March 2-5, 2020, University of Turin, Italy (LIPIcs). Ugo de'Liguoro, Stefano Berardi, and Thorsten Altenkirch, (Eds.) Vol. 188 . Schloss Dagstuhl-LeibnizZentrum für Informatik, 8 : 1-8 :9. isbn: 978-3-95977-182-5. do1i:0.4 230/LIPIcs.TYPES. 2020. 8. Ende Jin, Nada Amin, and Yizhou Zhang. 2023. Extensible metatheory mechanization via family polymorphisPmro.c. ACM Program. Lang., 7, PLDI, Article 172, ( June 2023 ), 25 pages. doi1:0. 1 145 /3591286. Jasper Hugunin. 2020. Why not w? In26th International Conference on Types for Proofs and Programs, TYPES 2020, March 2-5, 2020, University of Turin, Italy (LIPIcs). Ugo de'Liguoro, Stefano Berardi, and Thorsten Altenkirch, (Eds.) Vol. 188. Schloss Dagstuhl-LeibnizZentrum für Informatik, 8 : 1-8 :9. isbn: 978-3-95977-182-5. do1i:0.4 230/LIPIcs.TYPES. 2020. 8. Ende Jin, Nada Amin, and Yizhou Zhang. 2023. Extensible metatheory mechanization via family polymorphisPmro.c. ACM Program. Lang., 7, PLDI, Article 172, ( June 2023 ), 25 pages. doi1:0. 1 145 /3591286.

4. The Braga Method: Extracting Certified Algorithms from Complex Recursive Schemes in Coq

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

1. “Upon This Quote I Will Build My Church Thesis”;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Artifact Description;Lecture Notes in Computer Science;2024

3. Definitional Functoriality for Dependent (Sub)Types;Lecture Notes in Computer Science;2024

4. Observational Equality Meets CIC;Lecture Notes in Computer Science;2024