---
license: mit
task_categories:
  - text-generation
  - feature-extraction
language:
  - en
tags:
  - theorem-proving
  - formal-methods
  - tla+
  - distributed-systems
  - model-checking
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_examples: 3902
configs:
- config_name: default
  data_files:
  - split: train
    path: data/train-*
---

# TLA+

Structured dataset of TLA+ specifications from the official TLA+ Examples repository.

## Dataset Description

- **Source:** [tlaplus/Examples](https://github.com/tlaplus/Examples)
- **Entries:** 3,902
- **Files processed:** 304
- **License:** MIT

## Schema

| Column | Type | Description |
|--------|------|-------------|
| fact | string | Declaration body |
| type | string | definition, theorem, lemma, assume |
| library | string | Specification name (Paxos, DieHard, etc.) |
| imports | list | EXTENDS statements |
| filename | string | Source file path |
| symbolic_name | string | Declaration identifier |
| docstring | string | Documentation comment (where available) |

## Statistics

### By Type
| Type | Count |
|------|-------|
| definition | 3,511 |
| theorem | 224 |
| lemma | 125 |
| assume | 42 |

### By Library (Top 10)
| Library | Count |
|---------|-------|
| SpecifyingSystems | 681 |
| SDP_Verification | 468 |
| ewd998 | 290 |
| byzpaxos | 172 |
| dijkstra-mutex | 126 |
| FiniteMonotonic | 115 |
| Paxos | 108 |
| byihive | 105 |
| PaxosHowToWinATuringAward | 102 |
| LoopInvariance | 100 |

## About TLA+

TLA+ is a formal specification language developed by Leslie Lamport for designing, modeling, and verifying concurrent and distributed systems. It is widely used in industry (Amazon, Microsoft, Oracle) to verify critical system designs before implementation.

Key features:
- Based on set theory and temporal logic
- Model checking via TLC
- Proof system via TLAPS
- Used for consensus protocols, distributed databases, and concurrent algorithms

## Use Cases

- Retrieval/RAG for TLA+ specifications
- Learning distributed systems patterns
- Training embeddings for formal specifications
- Semantic search over protocol designs

## Related Datasets

- [Coq-Verdi](https://huggingface.co/datasets/phanerozoic/Coq-Verdi) - Verified distributed systems in Coq
- [Coq-Iris](https://huggingface.co/datasets/phanerozoic/Coq-Iris) - Concurrent separation logic
- [Lean4-Mathlib](https://huggingface.co/datasets/phanerozoic/Lean4-Mathlib) - Mathematical formalizations

## Citation

If you use this dataset, please cite the TLA+ Examples repository:

```bibtex
@software{tlaplus_examples,
  title={TLA+ Examples},
  url={https://github.com/tlaplus/Examples},
  publisher={TLA+ Foundation}
}
```