Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs 2020 Help me understand this report
A functional proof pearl: inverting the Ackermann hierarchy
Search citation statements
Paper Sections
Select...
1
Citation Types
0
1
0
Year Published
2020
2021
Publication Types
Select...
2
Relationship
0
2
Authors
Journals
Cited by 2 publications
(1 citation statement)
References 11 publications
0
1
0
“…This is why we proposed a detailed proof of the fact that α is computable in linear time (on a multitape Turing machine). Once our work was made public, L. Tran, A. Mohan and A. Hobor [TMH20] informed us that they had obtained a similar result by totally different methods (functional programming techniques). Our demonstration is elementary and builds partly on the exposition by G. Tourlakis [Tou12] of the primitive recursiveness of the graph of A.…”
Section: Introductionmentioning
confidence: 96%
“…This is why we proposed a detailed proof of the fact that α is computable in linear time (on a multitape Turing machine). Once our work was made public, L. Tran, A. Mohan and A. Hobor [TMH20] informed us that they had obtained a similar result by totally different methods (functional programming techniques). Our demonstration is elementary and builds partly on the exposition by G. Tourlakis [Tou12] of the primitive recursiveness of the graph of A.…”
Section: Introductionmentioning
confidence: 96%
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
