Pattern matching without K-Reference-Cited by-同舟云学术

Pattern matching without K

Published:2014-08-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 19th ACM SIGPLAN international conference on Functional programming
language:
Short-container-title:

Author:

Cockx Jesper¹,Devriese Dominique¹,Piessens Frank¹

Affiliation:

1. KU Leuven, Leuven, Belgium

Funder

Fonds Wetenschappelijk Onderzoek

Publisher

ACM

Link

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

Reference26 articles.

1. T. Altenkirch. Without-K problem 2012. URL https://lists.chalmers.se/pipermail/agda/2012/004104.html. On the Agda mailing list. T. Altenkirch. Without-K problem 2012. URL https://lists.chalmers.se/pipermail/agda/2012/004104.html. On the Agda mailing list.

2. Idris, a general-purpose dependently typed programming language: Design and implementation

3. J. Cockx. Yet another way Agda-without-K is incompatible with univalence 2014. URL https://lists.chalmers.se/pipermail/agda/2014/006367.html. On the Agda mailing list. J. Cockx. Yet another way Agda-without-K is incompatible with univalence 2014. URL https://lists.chalmers.se/pipermail/agda/2014/006367.html. On the Agda mailing list.

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

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

2. Some Remarks About Dependent Type Theory;The French School of Programming;2023-10-11

3. Subtyping Without Reduction;Lecture Notes in Computer Science;2022

4. Formalizing category theory in Agda;Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs;2021-01-17

5. A novice-friendly induction tactic for lean;Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs;2021-01-17