---
license: agpl-3.0
task_categories:
  - text-generation
  - feature-extraction
language:
  - en
tags:
  - theorem-proving
  - formal-methods
  - agda
  - dependent-types
size_categories:
  - 1K<n<10K
dataset_info:
  features:
  - {name: statement, dtype: string}
  - {name: proof, dtype: string}
  - {name: type, dtype: string}
  - {name: symbolic_name, dtype: string}
  - {name: library, dtype: string}
  - {name: filename, dtype: string}
  - {name: imports, list: string}
  - {name: deps, list: string}
  - {name: docstring, dtype: string}
  - {name: source_url, dtype: string}
  - {name: commit, dtype: string}
  splits:
  - {name: train, num_examples: 5696}
  config_name: default
configs:
- config_name: default
  data_files:
  - split: train
    path: data/train-*
---

# Agda-1Lab

Structured dataset from **1Lab** — Cross-linked reference resource for HoTT.

## Source

- Repository: https://github.com/plt-amy/1lab
- Commit: `e5a99a399a3c58922adef713f38314805810937c`
- Files: 728
- License: agpl-3.0

## Schema

| Column | Type | Description |
|--------|------|-------------|
| statement | string | Declaration signature/claim with the leading keyword removed (verbatim slice); the full declaration minus its proof |
| proof | string | Verbatim proof/body, empty if the declaration has none |
| type | string | Declaration keyword |
| symbolic_name | string | Declaration identifier |
| library | string | Sub-library |
| filename | string | Repository-relative source path |
| imports | list[string] | File-level `Require`/`Import` modules |
| deps | list[string] | Intra-corpus identifiers referenced |
| docstring | string | Preceding documentation comment, empty if absent |
| source_url | string | Upstream repository |
| commit | string | Upstream commit extracted |

## Statistics

- Entries: 5,696
- With proof: 4,758 (83.5%)
- With docstring: 0 (0.0%)
- Libraries: 164

### By type

| Type | Count |
|---|---|
| function | 5,264 |
| record | 311 |
| data | 116 |
| postulate | 5 |

## Example

```
Axiom-of-choice : Typeω
Axiom-of-choice =
  ∀ {ℓ ℓ'} {B : Type ℓ} {P : B → Type ℓ'}
  → is-set B → (∀ b → is-set (P b))
  → (∀ b → ∥ P b ∥)
  → ∥ (∀ b → P b) ∥
```

- type: function | symbolic_name: `Axiom-of-choice` | src/1Lab/Classical.lagda.md

## Use

Each declaration is split into a `statement` (signature/claim) and a `proof` (body) that are disjoint
and together form the complete declaration, for proof modeling, autoformalization, retrieval, and
dependency analysis via `deps`.

## Citation

```bibtex
@misc{agda_1lab_dataset,
  title  = {Agda-1Lab},
  author = {Norton, Charles},
  year   = {2026},
  note   = {Extracted from https://github.com/plt-amy/1lab, commit e5a99a399a3c},
  url    = {https://huggingface.co/datasets/phanerozoic/Agda-1Lab}
}
```