JonPRL

Declarations from JonPRL, a Nuprl-family proof refinement logic for computational type theory.

Source

• Repository: https://github.com/jonsterling/JonPRL
• Commit: f937a5461955fff8cb22331ecb6fdeae8df636d5
• Files: 53
• License: other

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: 771
• With proof: 516 (66.9%)
• With docstring: 0 (0.0%)
• Libraries: 7

By type

Type	Count
theorem	243
definition	227
operator	215
tactic	46
notation	40

Example

bottom-diverges : [ ¬ bot ⇓ ]
{
  unfold <not implies>;
  intro; aux {auto; unfold <has-value>; auto};
  bot-div #1
}.

• type: theorem | symbolic_name: bottom-diverges | example/approx.jonprl

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

@misc{jonprl_dataset,
  title  = {JonPRL},
  author = {Norton, Charles},
  year   = {2026},
  note   = {Extracted from https://github.com/jonsterling/JonPRL, commit f937a5461955},
  url    = {https://huggingface.co/datasets/phanerozoic/JonPRL}
}