Perspectives for proof unwinding by programming languages techniques
Danko Ilik

TL;DR
This paper explores future research directions in proof unwinding by applying programming language techniques, aiming to benefit mathematics and its foundations through interdisciplinary methodology.
Contribution
It introduces a novel perspective by importing programming language methodologies into proof theory, inspiring future research in mathematical foundations.
Findings
Proposes new directions for proof unwinding research.
Highlights potential benefits for mathematics and foundational studies.
Encourages interdisciplinary approaches between proof theory and programming languages.
Abstract
In this chapter, we propose some future directions of work, potentially beneficial to Mathematics and its foundations, based on the recent import of methodology from the theory of programming languages into proof theory. This scientific essay, written for the audience of proof theorists as well as the working mathematician, is not a survey of the field, but rather a personal view of the author who hopes that it may inspire future and fellow researchers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · History and Theory of Mathematics · graph theory and CDMA systems
