{"success":true,"data":{"author":"agda-unimath contributors (Rijke et al.); extraction by phanerozoic","bucketAccessType":"public","bucketName":"phanerozoic/Agda-UniMath","bucketPrefix":"","category":"Mathematics","cloudProvider":"huggingface","createdAt":"2026-11-21T22:16:38.768Z","description":"The agda-unimath library of formalized mathematics in univalent foundations and homotopy type theory (HoTT), written in the Agda proof assistant and split into one row per declaration. There are 11,582 entries across 39 libraries, and 9,595 of them carry proofs. The extraction is from upstream commit c85d7fb8 (3,035 source files). Each row gives the statement (signature), the verbatim proof body, the declaration kind, the identifier, the library, the file path, its imports, and the intra-corpus identifiers it uses. Uses include proof modeling and premise selection beyond Lean, comparing formal libraries across proof assistants, and studying how constructive and univalent mathematics is organized. It is one Parquet file; load it with pandas or Hugging Face datasets. The upstream agda-unimath repository is MIT licensed. Credit the agda-unimath contributors (Egbert Rijke et al.).","displayTitle":"agda-unimath: 11,582 Univalent Foundations Definitions and Proofs in Agda (agda-unimath, phanerozoic extraction)","huggingFaceUrl":"https://huggingface.co/datasets/phanerozoic/Agda-UniMath","id":"339ada49-1cd2-5483-bb72-61e258a56900","license":"MIT","licenseEvidenceUrl":"https://github.com/UniMath/agda-unimath/blob/master/LICENSE","objectCountEstimate":3,"probeStatus":"ok","region":"us","schemaCard":{"accessHints":[{"language":"python-datasets","snippet":"from datasets import load_dataset\nds = load_dataset(\"phanerozoic/Agda-UniMath\")"},{"language":"python-hub","snippet":"from huggingface_hub import snapshot_download\nsnapshot_download(repo_id=\"phanerozoic/Agda-UniMath\", repo_type=\"dataset\")"}],"caveats":["HuggingFace metadata: author=phanerozoic, license:mit, size_categories:10K<n<100K, format:parquet, downloads=58"],"format":"mixed","generatedAt":"2026-11-21T22:31:57.607Z","layout":{"example":"data/train-00000-of-00001.parquet","pattern":"{repoId}/{filename}"},"mountPath":"/mnt/archive","sampleHeaders":[{"bytes":"50415231150415c0958c01159cd2244c158080011500120000e08a46d05500000069732d636f6d706c6574652d70726f702d4d65747269632d4162203a207b6c31206c32203a204c6576656c7d20e28692201920006c051d01144050726f7020286c3120e28a94206c32294e3a59001934a654000455552e520010410000004311a82e4f00017619a30029058f053b0873756301a20592050c5c32296a000000636f6e76657267656e742d7365726965732d4e5700040a2042fc00102847203a204a2c0025061d7835050058526e001dbc5e65001923625c00008e2961006d29ac04616229bb2041622d50736575646f0d182453747275637475726520626c002c4162206c312920284d203a205a3c001c6c32202874797065411304472905ea040a2042f30100873e9200fe8d00ae8d0025f135790c380000003944003ab22302304700000073657175656e63652d05f62e4a009e1003305555206c31a30000006164642d624f00ae0002080a20205e4800004745f4721e006e3e0018830000006e6567fea700fea70000a92579659139723e70016584191f6d1f003a2970302077686572650a2020636f6e7345fa086f72206de4107465726d731959300a20206669656c640a20202020011c910c195c003a35524dfe191b0847298d21db446e6166756e63746f722d43617465676f72792e6703106c33206c34b93a04286c","encoding":"hex","key":"data/train-00000-of-00001.parquet","truncatedAt":512}],"sampleObjects":["data/train-00000-of-00001.parquet"],"sidecars":[{"bytes":"---\r\nlicense: mit\r\ntask_categories:\r\n  - text-generation\r\n  - feature-extraction\r\nlanguage:\r\n  - en\r\ntags:\r\n  - theorem-proving\r\n  - formal-methods\r\n  - agda\r\n  - dependent-types\r\nsize_categories:\r\n  - 1K<n<10K\r\ndataset_info:\r\n  features:\r\n  - {name: statement, dtype: string}\r\n  - {name: proof, dtype: string}\r\n  - {name: type, dtype: string}\r\n  - {name: symbolic_name, dtype: string}\r\n  - {name: library, dtype: string}\r\n  - {name: filename, dtype: string}\r\n  - {name: imports, list: string}\r\n  - {name: deps, list: string}\r\n  - {name: docstring, dtype: string}\r\n  - {name: source_url, dtype: string}\r\n  - {name: commit, dtype: string}\r\n  splits:\r\n  - {name: train, num_examples: 11582}\r\n  config_name: default\r\nconfigs:\r\n- config_name: default\r\n  data_files:\r\n  - split: train\r\n    path: data/train-*\r\n---\r\n\r\n# Agda-UniMath\r\n\r\nStructured dataset from **agda-unimath** — Univalent mathematics.\r\n\r\n## Source\r\n\r\n- Repository: https://github.com/UniMath/agda-unimath\r\n- Commit: `c85d7fb834778f96a66576318cdc4ef3d4b80a26`\r\n- Files: 3035\r\n- License: mit\r\n\r\n## Schema\r\n\r\n| Column | Type | Description |\r\n|--------|------|-------------|\r\n| statement | string | Declaration signature/claim with the leading keyword removed (verbatim slice); the full declaration minus its proof |\r\n| proof | string | Verbatim proof/body, empty if the declaration has none |\r\n| type | string | Declaration keyword |\r\n| symbolic_name | string | Declaration identifier |\r\n| library | string | Sub-library |\r\n| filename | string | Repository-relative source path |\r\n| imports | list[string] | File-level `Require`/`Import` modules |\r\n| deps | list[string] | Intra-corpus identifiers referenced |\r\n| docstring | string | Preceding documentation comment, empty if absent |\r\n| source_url | string | Upstream repository |\r\n| commit | string | Upstream commit extracted |\r\n\r\n## Statistics\r\n\r\n- Entries: 11,582\r\n- With proof: 9,595 (82.8%)\r\n- With docstring: 0 (0.0%)\r\n- Libraries: 39\r\n\r\n### By type\r\n\r\n| Type | Count |\r\n|---|---|\r\n| function | 11,307 |\r\n| record | 133 |\r\n| postulate | 80 |\r\n| data | 62 |\r\n\r\n## Example\r\n\r\n```\r\nis-complete-prop-Metric-Ab : {l1 l2 : Level} → Metric-Ab l1 l2 → Prop (l1 ⊔ l2)\r\nis-complete-prop-Metric-Ab G =\r\n  is-complete-prop-Metric-Space (metric-space-Metric-Ab G)\r\n```\r\n\r\n- type: function | symbolic_name: `is-complete-prop-Metric-Ab` | src/analysis/complete-metric-abelian-groups.lagda.md\r\n\r\n## Use\r\n\r\nEach declaration is split into a `statement` (signature/claim) and a `proof` (body) that are disjoint\r\nand together form the complete declaration, for proof modeling, autoformalization, retrieval, and\r\ndependency analysis via `deps`.\r\n\r\n## Citation\r\n\r\n```bibtex\r\n@misc{agda_unimath_dataset,\r\n  title  = {Agda-UniMath},\r\n  author = {Norton, Charles},\r\n  year   = {2026},\r\n  note   = {Extracted from https://github.com/UniMath/agda-unimath, commit c85d7fb83477},\r\n  url    = {https://huggingface.co/datasets/phanerozoic/Agda-UniMath}\r\n}\r\n```\r\n","encoding":"utf8","key":"README.md","name":"README.md","size":2956,"truncated":false}],"sourceObjectKey":"data/train-00000-of-00001.parquet","starterCell":"from datasets import load_dataset\nds = load_dataset(\"phanerozoic/Agda-UniMath\")\nprint(ds)","starterSamplePath":"data/train-00000-of-00001.parquet","totalObjects":3},"summary":"The agda-unimath library of formalized mathematics in univalent foundations and homotopy type theory (HoTT), written in the Agda proof assistant and split into one row per…","title":"agda-unimath: 11,582 Univalent Foundations Definitions and Proofs in Agda (agda-unimath, phanerozoic extraction)","updatedAt":"2026-11-22T00:31:28.180Z","visibility":"public","websiteUrl":"https://unimath.github.io/agda-unimath/"}}