---
license: mit
task_categories:
  - text-generation
  - feature-extraction
language:
  - en
tags:
  - theorem-proving
  - formal-methods
  - coq
  - quickchick
  - testing
  - property-based-testing
  - quickcheck
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: 2753}
  config_name: default
configs:
- config_name: default
  data_files:
  - split: train
    path: data/train-*
---

# Coq-QuickChick

Randomized property-based testing plugin for Coq, inspired by QuickCheck.

## Source

- Repository: https://github.com/QuickChick/QuickChick
- Commit: `5a6c291b11e9affe059c0e1812612bc474d0a129`
- Files: 109
- License: mit

## 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: 2,753
- With proof: 2,655 (96.4%)
- With docstring: 752 (27.3%)
- Libraries: 18

### By type

| Type | Count |
|---|---|
| Definition | 675 |
| Lemma | 575 |
| Instance | 380 |
| Inductive | 210 |
| Fixpoint | 188 |
| Theorem | 186 |
| Notation | 133 |
| Ltac2 | 132 |
| Class | 82 |
| Example | 71 |
| Parameter | 34 |
| Ltac | 33 |
| Axiom | 31 |
| Record | 11 |
| Coercion | 3 |
| Function | 3 |
| CoInductive | 2 |
| Corollary | 1 |
| Fact | 1 |
| Hypothesis | 1 |
| CoFixpoint | 1 |

## Example

```
between : nat -> nat -> nat -> Prop
:=
| between_n : forall n m, le n m -> between n (S n) (S (S m))
| between_S : forall n m o, between n m o -> between n (S m) (S o).
```

- type: Inductive | symbolic_name: `between` | benchmarks/BST/BST.v

## 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{coq_quickchick_dataset,
  title  = {Coq-QuickChick},
  author = {Norton, Charles},
  year   = {2026},
  note   = {Extracted from https://github.com/QuickChick/QuickChick, commit 5a6c291b11e9},
  url    = {https://huggingface.co/datasets/phanerozoic/Coq-QuickChick}
}
```