Abstract
AbstractLean 4 is a reimplementation of the Lean interactive theorem prover (ITP) in Lean itself. It addresses many shortcomings of the previous versions and contains many new features. Lean 4 is fully extensible: users can modify and extend the parser, elaborator, tactics, decision procedures, pretty printer, and code generator. The new system has a hygienic macro system custom-built for ITPs. It contains a new typeclass resolution procedure based on tabled resolution, addressing significant performance problems reported by the growing user base. Lean 4 is also an efficient functional programming language based on a novel programming paradigm called functional but in-place. Efficient code generation is crucial for Lean users because many write custom proof automation procedures in Lean itself.
Publisher
Springer International Publishing
Reference16 articles.
1. Buzzard, K., Commelin, J., Massot, P.: Formalising Perfectoid Spaces. In: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs. p. 299–312. CPP 2020, New York, NY, USA (2020). https://doi.org/10.1145/3372885.3373830, https://doi.org/10.1145/3372885.3373830
2. Buzzard, K., Hughes, C., Lau, K., Livingston, A., Mir, R.F., Morrison, S.: Schemes in Lean. https://arxiv.org/abs/2101.02602 (2021), arXiv$$:$$2101.02602
3. Chu, S., Murphy, B., Roesch, J., Cheung, A., Suciu, D.: Axiomatic foundations and algorithms for deciding semantic equivalences of SQL queries. Proc. VLDB Endow. 11(11), 1482–1495 (Jul 2018). https://doi.org/10.14778/3236187.3236200, https://doi.org/10.14778/3236187.3236200
4. Coquand, T., Huet, G.: The calculus of constructions. Inform. and Comput. 76(2–3), 95–120 (1988)
5. van Doorn, F., Ebner, G., Lewis, R.Y.: Maintaining a library of formal mathematics. In: Benzmüller, C., Miller, B. (eds.) Intelligent Computer Mathematics, pp. 251–267. Springer International Publishing, Cham (2020)
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Formal Methods in Industry;Formal Aspects of Computing;2024-08-21
2. How We Built Cedar: A Verification-Guided Approach;Companion Proceedings of the 32nd ACM International Conference on the Foundations of Software Engineering;2024-07-10
3. Verified Extraction from Coq to OCaml;Proceedings of the ACM on Programming Languages;2024-06-20
4. Machine Learning and Information Theory Concepts towards an AI Mathematician;Bulletin of the American Mathematical Society;2024-05-15
5. The formal verification of the ctm approach to forcing;Annals of Pure and Applied Logic;2024-05