Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2508.15878
Cited By
Lean Meets Theoretical Computer Science: Scalable Synthesis of Theorem Proving Challenges in Formal-Informal Pairs
21 August 2025
Terry Jingchen Zhang
Wenyuan Jiang
Rongchuan Liu
Yisong Wang
J. Yang
Ning Wang
Nicole Ni
Yinya Huang
Mrinmaya Sachan
AIMat
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Lean Meets Theoretical Computer Science: Scalable Synthesis of Theorem Proving Challenges in Formal-Informal Pairs"
0 / 0 papers shown
Title
No papers found
