fact stringlengths 9 20.3k | type stringclasses 2
values | library stringclasses 116
values | imports listlengths 0 239 | filename stringlengths 21 103 | symbolic_name stringlengths 1 92 | docstring null |
|---|---|---|---|---|---|---|
morelet_indent : let x = 2 in p x ∧ y | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | morelet_indent | null |
eliot_let_indent : foo x = let a = b in z | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | eliot_let_indent | null |
term_quantifiers : Q1 (\x. big long expression x) /\ Q2 (\ x. big long expression x) /\ P1 (λy. big longer expression y) /\ P2 (λ y. big longer expression y) /\ p (@n. something long on n) /\ p (@ n. something long on n) /\ R (LEAST n. yea another long expression on n) /\ R' (some(m,n). yea another long expression on m... | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | term_quantifiers | null |
EXISTS_i2mw : !x. mw_ok (SND x) /\ ~(x = (T,[])) ==> ?y. x = i2mw y | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | EXISTS_i2mw | null |
foo : P (s with <| fld1 := foo.other_fld |>, second_component) ∧ Q (s with fld1 := foo_bar, second_component) ∧ R (s with <| fld := foo_bar |>, fld) | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | foo | null |
bar : <| field := v1 ; field2 := v2 |> | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | bar | null |
foo_bar : f x : bool ∧ Q | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | foo_bar | null |
read_while_P_lem : ∀ls rest P x y. EVERY P rest ∧ read_while P ls rest = (x,y) ⇒ EVERY P x | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | read_while_P_lem | null |
foo = foo x = x + 2 | definition | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | foo | null |
bar = bar x y ⇔ ∀z. x + z < y + z ∧ let a = 2 * x ; b = 3 * z in a * b ≤ x | definition | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | bar | null |
foo = foo x = case x of NONE => 3 | SOME z => 4 | definition | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/indentScript.sml | foo | null |
bar : x = x | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | bar | null |
foo : x = x | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | foo | null |
baz : x ∧ let a = b; c = d; in x ⇒ a ∧ c | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | baz | null |
ifindent1 : p = if x = 3 then 10 else 14 | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | ifindent1 | null |
ifindent2 : p = if x = 3 then 10 else if x = 10 then 14 else 16 | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | ifindent2 | null |
caseindent1 : p ⇒ case x of | y => z + y + long expression | a => something | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | caseindent1 | null |
caseindent2 : p ⇒ case x of y => z + y + long expression | a => something | b => last thing ∧ something | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | caseindent2 | null |
doindent1 : do x <- e1; y <- e2; od | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | doindent1 | null |
first_suffices_by_indent : some_asm ∧ p ⇒ some_goal | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | first_suffices_by_indent | null |
first_by_indent : some_goal | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | first_by_indent | null |
later_suffices_by_by_indent : some_goal | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | later_suffices_by_by_indent | null |
alpha_qfier_and_blashthen : (LEAST n. p ∧ q n ⇒ r n) = 10 | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | alpha_qfier_and_blashthen | null |
eval_op_later : eval_op f vs s = (res,t) ⇒ s ≤ t | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | eval_op_later | null |
ceqnat_behaviour : ceqnat @@ church n @@ church m -n->* cB (n = m) | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | ceqnat_behaviour | null |
testTHENL : foo | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | testTHENL | null |
morelet_indent : let x = 2 in p x ∧ y | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | morelet_indent | null |
eliot_let_indent : foo x = let a = b in z | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | eliot_let_indent | null |
term_quantifiers : Q1 (\x. big long expression x) /\ Q2 (\ x. big long expression x) /\ P1 (λy. big longer expression y) /\ P2 (λ y. big longer expression y) /\ p (@n. something long on n) /\ p (@ n. something long on n) /\ R (LEAST n. yea another long expression on n) /\ R' (some(m,n). yea another long expression on m... | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | term_quantifiers | null |
EXISTS_i2mw : !x. mw_ok (SND x) /\ ~(x = (T,[])) ==> ?y. x = i2mw y | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | EXISTS_i2mw | null |
foo : P (s with <| fld1 := foo.other_fld |>, second_component) ∧ Q (s with fld1 := foo_bar, second_component) ∧ R (s with <| fld := foo_bar |>, fld) | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | foo | null |
broken : foo | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | broken | null |
every_node_has_unique_connected_component : ∀n. n ∈ nodes g ⇒ ∃!cc. cc ∈ connected_components g ∧ n ∈ nodes cc | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | every_node_has_unique_connected_component | null |
every_node_has_unique_connected_component : ∀n. n ∈ nodes g ⇒ ?!cc. cc ∈ connected_components g ∧ n ∈ nodes cc | theorem | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | every_node_has_unique_connected_component | null |
foo = foo x = x + 2 | definition | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | foo | null |
bar = bar x y ⇔ ∀z. x + z < y + z ∧ let a = 2 * x ; b = 3 * z in a * b ≤ x | definition | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | bar | null |
foo = foo x = case x of NONE => 3 | SOME z => 4 | definition | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | foo | null |
foo = foo x = λy z. y + z | definition | tools | [
"foobar"
] | tools/editor-modes/emacs/mode-tests/sampleScript.sml | foo | null |
foo : foo | theorem | tools | [] | tools/Holmake/tests/gh1371/bugScript.sml | foo | null |
bar : bar | theorem | tools | [] | tools/Holmake/tests/gh1371/bugScript.sml | bar | null |
bar = bar x y = x + 1 | definition | tools | [] | tools/Holmake/tests/no_sig_docs/fooScript.sml | bar | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.