Update README.md
Browse files
README.md
CHANGED
@@ -1,3 +1,33 @@
|
|
1 |
---
|
2 |
license: mit
|
|
|
|
|
|
|
|
|
|
|
|
|
3 |
---
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
---
|
2 |
license: mit
|
3 |
+
inference:
|
4 |
+
parameters:
|
5 |
+
max_length: 1024
|
6 |
+
widget:
|
7 |
+
- text: "a b : ℕ\n⊢ a + b = b + a"
|
8 |
+
example_title: "Example"
|
9 |
---
|
10 |
+
|
11 |
+
[LeanDojo: Theorem Proving with Retrieval-Augmented Language Models](https://arxiv.org/abs/xxxx.xxxxx)
|
12 |
+
Under review, NeurIPS (Datasets and Benchmarks Track), 2023
|
13 |
+
[Kaiyu Yang](https://yangky11.github.io/), [Aidan Swope](https://aidanswope.com/about), [Alex Gu](https://minimario.github.io/), [Rahul Chalamala](https://www.linkedin.com/in/rchalamala),
|
14 |
+
[Peiyang Song](https://www.linkedin.com/in/peiyang-song-3279b3251/), [Shixing Yu](https://billysx.github.io/), [Saad Godil](https://www.linkedin.com/in/saad-godil-9728353/), [Ryan Prenger](https://www.linkedin.com/in/ryan-prenger-18797ba1/), [Anima Anandkumar](http://tensorlab.cms.caltech.edu/users/anima/)
|
15 |
+
|
16 |
+
```bibtex
|
17 |
+
@article{yang2023leandojo,
|
18 |
+
title={{LeanDojo}: Theorem Proving with Retrieval-Augmented Language Models},
|
19 |
+
author={Yang, Kaiyu and Swope, Aidan and Gu, Alex and Chalamala, Rahul and Song, Peiyang and Yu, Shixing and Godil, Saad and Prenger, Ryan and Anandkumar, Anima},
|
20 |
+
journal={arXiv preprint arXiv:xxxx.xxxxx},
|
21 |
+
year={2023}
|
22 |
+
}
|
23 |
+
```
|
24 |
+
|
25 |
+
Please visit [LeanDojo Website](https://leandojo.org/) for details.
|
26 |
+
|
27 |
+
## Input Format
|
28 |
+
|
29 |
+
The model's input consists of retrieved premises concatenated with the current proof state and truncated to 2300 UTF-8 bytes.
|
30 |
+
The proof state is formatted by Lean's pretty printer, the same as the input format of our [model w/o retrieval](https://huggingface.co/kaiyuy/leandojo-lean3-tacgen-byt5-small).
|
31 |
+
Retrieved premises are in the form of Lean code, except that their fully qualified names (marked by `<a>...</a>` are used). Please see the example on the right.
|
32 |
+
|
33 |
+
|