Type Theory based on Dependent Inductive and Coinductive Types-Reference-Cited by-同舟云学术

Type Theory based on Dependent Inductive and Coinductive Types

Published:2016-07-05 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Basold Henning¹,Geuvers Herman²

Affiliation:

1. Radboud University, CWI, Amsterdam

2. Radboud University, Technical University Eindhoven

Funder

Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Publisher

ACM

Link

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

Reference30 articles.

1. Wellfounded recursion with copatterns

2. Copatterns

3. Agda. Agda Documentation. Technical report Programming Logic group Chalmers and Gothenburg University 2015. URL http://wiki.portal.chalmers.se/agda/. Version 2.4.2.5. Agda. Agda Documentation. Technical report Programming Logic group Chalmers and Gothenburg University 2015. URL http://wiki.portal.chalmers.se/agda/. Version 2.4.2.5.

4. B. Ahrens P. Capriotti and R. Spadotti. Non-wellfounded trees in Homotopy Type Theory. ArXiv150402949 Cs Math Apr. 2015. B. Ahrens P. Capriotti and R. Spadotti. Non-wellfounded trees in Homotopy Type Theory. ArXiv150402949 Cs Math Apr. 2015.

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

1. Deriving Dependently-Typed OOP from First Principles;Proceedings of the ACM on Programming Languages;2024-04-29

2. Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice;Logical Methods in Computer Science;2022-11-14

3. SIGNATURES AND INDUCTION PRINCIPLES FOR HIGHER INDUCTIVE-INDUCTIVE TYPES;LOG METH COMPUT SCI;2020

4. Constructing quotient inductive-inductive types;Proceedings of the ACM on Programming Languages;2019-01-02

5. Project Report: Dependently Typed Programming with Lambda Encodings in Cedille;Lecture Notes in Computer Science;2019