Re-extract: full statement+proof, normalized schema, provenance

README.md

@@ -19,7 +19,6 @@ dataset_info:
   - {name: statement, dtype: string}
   - {name: proof, dtype: string}
   - {name: type, dtype: string}
-  - {name: kind, dtype: string}
   - {name: symbolic_name, dtype: string}
   - {name: library, dtype: string}
   - {name: filename, dtype: string}
@@ -31,7 +30,6 @@ dataset_info:
   - {name: has_proof, dtype: bool}
   - {name: source_url, dtype: string}
   - {name: commit, dtype: string}
-  - {name: content_level, dtype: string}
   splits:
   - {name: train, num_examples: 268}
   config_name: default
@@ -57,11 +55,10 @@ Declarations from RedPRL, a cubical/computational type theory system.
 
 | Column | Type | Description |
 |--------|------|-------------|
-| fact | string | Verbatim declaration: statement followed by proof where present |
-| statement | string | Verbatim statement (keyword through the closing period) |
-| proof | string | Verbatim proof block (`Proof. ... Qed.`/`Defined.`), empty if none |
-| type | string | Raw declaration keyword |
-| kind | string | Normalized kind |
+| fact | string | Complete verbatim declaration (keyword, signature, and body/proof) |
+| statement | string | Signature with the leading keyword removed (verbatim slice) |
+| proof | string | Verbatim proof/body, empty if none |
+| type | string | Declaration keyword |
 | symbolic_name | string | Declaration identifier |
 | library | string | Sub-library |
 | filename | string | Repository-relative source path |
@@ -73,7 +70,6 @@ Declarations from RedPRL, a cubical/computational type theory system.
 | has_proof | bool | Whether a proof block was captured |
 | source_url | string | Upstream repository |
 | commit | string | Upstream commit extracted |
-| content_level | string | `statement+proof` |
 
 ## Statistics
 
@@ -92,18 +88,19 @@ Declarations from RedPRL, a cubical/computational type theory system.
 ## Example
 
 ```coq
-theorem Connection/And/Diagonal (#l:lvl) :
-  (->
-   [ty : (U #l hcom)]
-   [a b : ty]
-   [p : (path [_] ty a b)]
-   (= (path [_] ty a b) (abs [i] (@ ($ (Connection/And #l) ty a b p) i i)) p))
-by {
-  lam ty a b p => unfold Connection/And; auto
+theorem Test(#l:lvl) : (Category (++#l)) by {
+  { ob = `(U #l)
+  , hom = lam ty/a ty/b => `(-> ty/a ty/b)
+  , idn = lam ty/a x => `x
+  , cmp = lam ty/a ty/b ty/a f g x => use f [use g [`x]]
+  , idn/l = lam _ _ _ => auto
+  , idn/r = lam _ _ _ => auto
+  , assoc = lam _ _ _ _ _ _ _ => auto
+  }
 }.
 ```
 
-- kind: theorem | symbolic_name: `Connection` | example/connection.prl:18
+- type: theorem | symbolic_name: `Test` | example/category.prl:33
 
 ## Use
 

data/train-00000-of-00001.parquet

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:ef7bdbbecbc37c796bcbcd584613702fe3b019f3e4e28f508ef630315e640ecb
-size 64315
+oid sha256:ad4a98aacee6be220ad272f03f9b925a16a5a786b9740ace616df82c17a09ab1
+size 58652