Bouncing Threads for Circular and Non-Wellfounded Proofs-Reference-Cited by-同舟云学术

Bouncing Threads for Circular and Non-Wellfounded Proofs

Published:2022-08-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Baelde David¹,Doumane Amina²,Kuperberg Denis³,Saurin Alexis⁴

Affiliation:

1. IRISA, ENS Rennes, France

2. LIP, CNRS and ENS de Lyon, France

3. LIP, CNRS and ENS Lyon, France

4. IRIF, CNRS, Université Paris Cité and INRIA, France

Funder

Agence Nationale de la Recherche

Publisher

ACM

Link

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

Reference41 articles.

1. Mixed Inductive/Coinductive Types and Strong Normalization

2. Andreas Abel . 2016. Compositional Coinduction with Sized Types. (2016). Abstract for the invited talk at the 13th IFIP WG 1.3 International Workshop on Coalgebraic Methods in Computer Science (CMCS 2016 ), Eindhoven, the Netherlands , 2-3 April 2016. Andreas Abel. 2016. Compositional Coinduction with Sized Types. (2016). Abstract for the invited talk at the 13th IFIP WG 1.3 International Workshop on Coalgebraic Methods in Computer Science (CMCS 2016), Eindhoven, the Netherlands, 2-3 April 2016.

3. Well-founded recursion with copatterns and sized types

4. Copatterns

5. Least and Greatest Fixed Points in Linear Logic

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

1. Parametric Subtyping for Structural Parametric Polymorphism;Proceedings of the ACM on Programming Languages;2024-01-05

2. Computational expressivity of (circular) proofs with fixed points;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

3. A Logical Account of Subtyping for Session Types;Electronic Proceedings in Theoretical Computer Science;2023-04-13

4. A Linear Perspective on Cut-Elimination for Non-wellfounded Sequent Calculi with Least and Greatest Fixed-Points;Lecture Notes in Computer Science;2023