| license: mit | |
| tags: | |
| - theorem-proving | |
| - formal-methods | |
| - coq | |
| task_categories: | |
| - text-generation | |
| - feature-extraction | |
| language: | |
| - en | |
| size_categories: | |
| - 1K<n<10K | |
| dataset_info: | |
| features: | |
| - name: fact | |
| dtype: string | |
| - name: type | |
| dtype: string | |
| - name: library | |
| dtype: string | |
| - name: imports | |
| list: string | |
| - name: filename | |
| dtype: string | |
| - name: symbolic_name | |
| dtype: string | |
| - name: docstring | |
| dtype: string | |
| splits: | |
| - name: train | |
| num_bytes: 1849390 | |
| num_examples: 2936 | |
| download_size: 459776 | |
| dataset_size: 1849390 | |
| configs: | |
| - config_name: default | |
| data_files: | |
| - split: train | |
| path: data/train-* | |
| # Coq-InteractionTrees | |
| Structured dataset from **Interaction Trees** — Representing recursive and impure programs. | |
| **2,936 declarations** extracted from Coq source files. | |
| ## Applications | |
| - Training language models on formal proofs | |
| - Fine-tuning theorem provers | |
| - Retrieval-augmented generation for proof assistants | |
| - Learning proof embeddings and representations | |
| ## Source | |
| - **Repository:** https://github.com/DeepSpec/InteractionTrees | |
| ## Schema | |
| | Column | Type | Description | | |
| |--------|------|-------------| | |
| | fact | string | Declaration body | | |
| | type | string | Lemma, Definition, Theorem, etc. | | |
| | library | string | Source module | | |
| | imports | list | Required imports | | |
| | filename | string | Source file path | | |
| | symbolic_name | string | Identifier | | |