Bialgebraic Reasoning on Higher-order Program Equivalence-Reference-Cited by-同舟云学术

Bialgebraic Reasoning on Higher-order Program Equivalence

Published:2024-07-08 Issue: Volume:20 Page:1-15
ISSN:
Container-title:Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Goncharov Sergey¹^ORCID,Milius Stefan¹^ORCID,Tsampas Stelios¹^ORCID,Urbat Henning¹^ORCID

Affiliation:

1. Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Germany

Funder

Deutsche Forschungsgemeinschaft

Publisher

ACM

Link

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

Reference85 articles.

1. Fully Abstract and Robust Compilation

2. S. Abramsky. 1990. The lazy λ-calculus. In Research topics in Functional Programming. Addison Wesley, 65--117.

3. Jiří Adámek, Horst Herrlich, and George E. Strecker. 1990. Abstract and Concrete Categories. John Wiley and Sons. Free online version: http://www.tac.mta.ca/tac/reprints/articles/17/tr17abs.html.

4. Jiří Adámek, Stefan Milius, and Lawrence S. Moss. 2021. Initial Algebras Without Iteration. In 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 211), Fabio Gadducci and Alexandra Silva (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 5:1--5:20.

5. Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice

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

1. Bialgebraic Reasoning on Higher-order Program Equivalence;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08