A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods M Ikebuchi Logical Methods in Computer Science 18, 2022 | 6 | 2022 |
Certifying derivation of state machines from coroutines M Ikebuchi, A Erbsen, A Chlipala Proceedings of the ACM on Programming Languages 6 (POPL), 1-31, 2022 | 3 | 2022 |
A homological condition on equational unifiability M Ikebuchi 46th International Symposium on Mathematical Foundations of Computer Science …, 2021 | 2 | 2021 |
On properties of -terms M Ikebuchi, K Nakano Logical Methods in Computer Science 16, 2020 | 2 | 2020 |
On repetitive right application of B-terms M Ikebuchi, K Nakano arXiv preprint arXiv:1703.10938, 2017 | 1 | 2017 |
Applications of Homological Algebra to Equational Theories M Ikebuchi Massachusetts Institute of Technology, 2022 | | 2022 |
On properties of -terms M Ikebuchi, K Nakano arXiv preprint arXiv:1901.11010, 2019 | | 2019 |
ComplCoq: Rewrite Hint Construction with Completion Procedures M Ikebuchi, K Nakano | | |