statement stringlengths 4 1.37k | proof stringclasses 1
value | type stringclasses 6
values | symbolic_name stringlengths 1 27 | library stringclasses 4
values | filename stringclasses 35
values | imports listlengths 0 0 | deps listlengths 0 25 | docstring stringclasses 1
value | source_url stringclasses 1
value | commit stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|
ONTO : TERM
----
ONTO = mk_const("ONTO", Fun(Fun Star StarStar)Bool) | HOLCONST | ONTO | hol | src/hol/spc003.doc | [] | [
"Bool",
"Fun",
"Star",
"StarStar",
"mk_const"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
ONTO_def : TERM
----
ONTO_def =
let f = mk_var("f",Fun Star StarStar)
in let x = mk_var("x",Star)
in let y = mk_var("y",StarStar) in
mk_abs(f, mk_forall(y, mk_exists(x, mk_eq(y, mk_comb(f, x))))) | HOLCONST | ONTO_def | hol | src/hol/spc003.doc | [] | [
"Fun",
"Star",
"StarStar",
"mk_abs",
"mk_comb",
"mk_eq",
"mk_exists",
"mk_forall",
"mk_var"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
Type_Definition : TYPE → TYPE → TERM
----
ty1 ty2 •
Type_Definition ty1 ty2 =
mk_const("Type_Definition", (Fun (Fun ty2 Bool) (Fun(Fun ty1 ty2)Bool))) | HOLCONST | Type_Definition | hol | src/hol/spc003.doc | [] | [
"Bool",
"Fun",
"mk_const"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
Type_Definition_def : TERM
----
Type_Definition_def =
let P = mk_var("P",Fun StarStar Bool)
in let rep = mk_var("rep",Fun Star StarStar)
in let x = mk_var("x",StarStar)
in let y = mk_var("y",Star) in
mk_abs(P, mk_abs(rep,
mk_conj(mk_comb(One_One, rep),
mk_forall(x, mk_eq(mk_comb(P, x), mk_exists(y,
mk_... | HOLCONST | Type_Definition_def | hol | src/hol/spc003.doc | [] | [
"Bool",
"Fun",
"One_One",
"Star",
"StarStar",
"mk_abs",
"mk_comb",
"mk_conj",
"mk_eq",
"mk_exists",
"mk_forall",
"mk_var"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_type : î → STRING → THEORY → THEORY → BOOL
----
arity name thy1 thy2 •
new_type arity name thy1 thy2 ¤
³ name Dom(types thy1) ∧
types thy2 = types thy1 À {(name, arity)} ∧
constants thy2 = constants thy1 ∧
axioms thy2 = axioms thy1 | HOLCONST | new_type | hol | src/hol/spc003.doc | [] | [
"Dom",
"STRING",
"axioms",
"constants",
"types"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_constant : STRING → TYPE → THEORY → THEORY → BOOL
----
name type thy1 thy2 •
new_constant name type thy1 thy2 ¤
³ name Dom(constants thy1) ∧
type wf_type (types thy1) ∧
constants thy2 = constants thy1 À {(name, type)} ∧
types thy2 = types thy1 ∧
axioms thy2 = axioms thy1 | HOLCONST | new_constant | hol | src/hol/spc003.doc | [] | [
"Dom",
"STRING",
"axioms",
"constants",
"types",
"wf_type"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_axioms : (TERM SET) → THEORY → THEORY → BOOL
----
tms thy1 thy2 •
new_axioms tms thy1 thy2 =
let seqs = {(x, tm) | x = {} ∧ tm tms}
in
seqs sequents thy1 ∧
types thy2 = types thy1 ∧
constants thy2 = constants thy1 ∧
axioms thy2 = axioms thy1 À seqs | HOLCONST | new_axioms | hol | src/hol/spc003.doc | [] | [
"axioms",
"constants",
"sequents",
"types"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_axiom : TERM → THEORY → THEORY → BOOL
----
tm thy1 thy2 •
new_axiom tm thy1 thy2 = new_axioms {tm} thy1 thy2 | HOLCONST | new_axiom | hol | src/hol/spc003.doc | [] | [
"new_axioms"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_definition : STRING → TERM → THEORY → THEORY → BOOL
----
name tm thy1 thy2 •
new_definition name tm thy1 thy2 ¤
let ty = type_of_term tm
in
thy1a •
new_constant name ty thy1 thy1a ∧
freevars_set tm = {} ∧
term_tyvars tm type_tyvars ty ∧
new_axiom (mk_eq(mk_const(name, ty), tm)) thy1a th... | HOLCONST | new_definition | hol | src/hol/spc003.doc | [] | [
"STRING",
"freevars_set",
"mk_const",
"mk_eq",
"new_axiom",
"new_constant",
"term_tyvars",
"type_of_term",
"type_tyvars"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
LOG : THEORY
----
thy1 thy2 thy3 thy4 thy5 thy6 thy7 thy8 thy9 •
let Name = ⇔ con • Ås • ty • mk_const(s, ty) = con
in
(new_definition (Name Truth) Truth_def MIN thy1
∧ new_definition (Name (Forall Star)) Forall_def thy1 thy2
∧ new_definition (Name (Exists Star)) Exists_def thy2 thy3
∧ new_definition (N... | HOLCONST | LOG | hol | src/hol/spc003.doc | [] | [
"Conjunction",
"Conjunction_def",
"Disjunction",
"Disjunction_def",
"Exists",
"Exists_def",
"Falsity",
"Falsity_def",
"Forall",
"Forall_def",
"MIN",
"Negation",
"Negation_def",
"ONTO",
"ONTO_def",
"One_One",
"One_One_def",
"Star",
"StarStar",
"Truth",
"Truth_def",
"Type_Def... | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
has_list_mk_exists : (TERM LIST) → TERM → TERM → BOOL
----
(tm1 tm2 • has_list_mk_exists [] tm1 tm2 ¤ tm1 = tm2)
∧
( v rest tm1 tm2 •
has_list_mk_exists (Cons v rest) tm1 tm2 ¤
rem • has_mk_exists(v, rem) tm2 ∧
has_list_mk_exists rest rem tm1) | HOLCONST | has_list_mk_exists | hol | src/hol/spc003.doc | [] | [
"has_mk_exists"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_constants : ((STRING × TYPE) SET) → THEORY → THEORY → BOOL
----
cons thy1 thy2 •
new_constants cons thy1 thy2 ¤
Dom cons ¬ Dom (constants thy1) = {} ∧
Ran cons wf_type(types thy1) ∧
constants thy2 = constants thy1 À cons ∧
types thy2 = types thy1 ∧
axioms thy2 = axioms thy1 | HOLCONST | new_constants | hol | src/hol/spc003.doc | [] | [
"Dom",
"Ran",
"STRING",
"axioms",
"constants",
"types",
"wf_type"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_specification : ((STRING × (STRING × TYPE)) LIST) →
TERM → THM → THEORY → THEORY → BOOL
----
pairs tm thm thy1 thy2 •
new_specification pairs tm thm thy1 thy2 =
let conl = Fst(Split pairs)
in let varl = Map mk_var (Snd(Split pairs))
in let tyl = Map Snd (Snd(Split pairs))
in let subs = ⇔ (s... | HOLCONST | new_specification | hol | src/hol/spc003.doc | [] | [
"Distinct",
"Elems",
"LOG",
"STRING",
"extends",
"freevars_set",
"has_list_mk_exists",
"mk_const",
"mk_var",
"new_axiom",
"new_constants",
"subst",
"term_tyvars",
"thm_seq",
"thm_thy",
"type_tyvars"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_type_definition :
STRING → (STRING LIST) → THM → THEORY → THEORY → BOOL
----
name typars thm thy1 thy2 •
new_type_definition name typars thm thy1 thy2 ¤
p xty x ty px thy1a axiom •
let newty = mk_type(name, Map mk_var_type typars)
in let f = mk_var("f", Fun newty ty)
in thy1 extends LOG
∧... | HOLCONST | new_type_definition | hol | src/hol/spc003.doc | [] | [
"Distinct",
"Elems",
"Fun",
"LOG",
"STRING",
"Type_Definition",
"concl",
"extends",
"freevars_set",
"has_mk_comb",
"has_mk_exists",
"hyp",
"mk_comb",
"mk_type",
"mk_var",
"mk_var_type",
"new_axiom",
"new_type",
"term_tyvars",
"thm_seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
BOOL_CASES_AX : TERM
----
BOOL_CASES_AX =
let b = mk_var("b", Bool)
in mk_forall(b, mk_disj(mk_eq(b, Truth), mk_eq(b, Falsity))) | HOLCONST | BOOL_CASES_AX | hol | src/hol/spc003.doc | [] | [
"Bool",
"Falsity",
"Truth",
"mk_disj",
"mk_eq",
"mk_forall",
"mk_var"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
IMP_ANTISYM_AX : TERM
----
IMP_ANTISYM_AX =
let b1 = mk_var("b1", Bool)
in let b2 = mk_var("b2", Bool)
in mk_forall(b1, mk_forall(b2,
mk_imp(mk_imp(mk_imp(b1, b2), mk_imp(b2, b1)), mk_eq(b1, b2)))) | HOLCONST | IMP_ANTISYM_AX | hol | src/hol/spc003.doc | [] | [
"Bool",
"mk_eq",
"mk_forall",
"mk_imp",
"mk_var"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
ETA_AX : TERM
----
ETA_AX =
let f = mk_var("f1", Fun Star StarStar)
in let x = mk_var("x", Star)
in mk_forall(f, mk_eq(mk_abs(x, mk_comb(f, x)), f)) | HOLCONST | ETA_AX | hol | src/hol/spc003.doc | [] | [
"Fun",
"Star",
"StarStar",
"mk_abs",
"mk_comb",
"mk_eq",
"mk_forall",
"mk_var"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
SELECT_AX : TERM
----
SELECT_AX =
let P = mk_var("P", Fun Star Bool)
in let x = mk_var("x", Star)
in mk_forall(P,mk_forall(x,
mk_imp(mk_comb(P, x), mk_comb(P, mk_comb(Choice, P))))) | HOLCONST | SELECT_AX | hol | src/hol/spc003.doc | [] | [
"Bool",
"Choice",
"Fun",
"Star",
"mk_comb",
"mk_forall",
"mk_imp",
"mk_var"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
INFINITY_AX : TERM
----
INFINITY_AX =
let f = mk_var("f", Fun Ind Ind)
in mk_conj(mk_comb(One_One, f), mk_comb(Negation, mk_comb(ONTO, f))) | HOLCONST | INFINITY_AX | hol | src/hol/spc003.doc | [] | [
"Fun",
"Ind",
"Negation",
"ONTO",
"One_One",
"mk_comb",
"mk_conj",
"mk_var"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
INIT : THEORY
----
thy1 thy2 thy3 thy4 thy5 thy6 •
new_axiom BOOL_CASES_AX LOG thy1
∧ new_axiom IMP_ANTISYM_AX thy1 thy2
∧ new_axiom ETA_AX thy2 thy3
∧ new_axiom SELECT_AX thy4 thy5
∧ new_type 0 (Fst(dest_type Ind)) thy5 thy6
∧ new_axiom INFINITY_AX thy6 INIT | HOLCONST | INIT | hol | src/hol/spc003.doc | [] | [
"BOOL_CASES_AX",
"ETA_AX",
"IMP_ANTISYM_AX",
"INFINITY_AX",
"Ind",
"LOG",
"SELECT_AX",
"dest_type",
"new_axiom",
"new_type"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
definitional_extension : THEORY → THEORY SET
----
thy • definitional_extension thy = ¥{thyset |
thy thyset
∧ ( thy1 thy2 arity name •
thy1 thyset ∧
new_type arity name thy1 thy2 ⇒ thy2 thyset
) ∧ (
thy1 thy2 name type •
thy1 thyset ∧
new_constant name type thy1 thy2 ⇒ thy2 thyset
) ∧ ... | HOLCONST | definitional_extension | hol | src/hol/spc003.doc | [] | [
"new_constant",
"new_definition",
"new_specification",
"new_type",
"new_type_definition"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
SUBST : ((STRING × TYPE) → THM) →
TERM → THM → THM → BOOL
----
eqs tm old_thm new_thm •
SUBST eqs tm old_thm new_thm =
let old_seq = thm_seq old_thm in let old_thy = thm_thy old_thm
in let new_seq = thm_seq new_thm in let new_thy = thm_thy new_thm
in
SUBST_rule (thm_seq o eqs) tm old_seq new_seq... | HOLCONST | SUBST | hol | src/hol/spc004.doc | [] | [
"Graph",
"Ran",
"STRING",
"SUBST_rule",
"extends",
"thm_seq",
"thm_thy"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
ABS : (STRING × TYPE) → THM → THM → BOOL
----
vty old_thm new_thm •
ABS vty old_thm new_thm =
let old_seq = thm_seq old_thm in let old_thy = thm_thy old_thm
in let new_seq = thm_seq new_thm in let new_thy = thm_thy new_thm
in
ABS_rule vty old_seq new_seq ∧
new_thy extends old_thy | HOLCONST | ABS | hol | src/hol/spc004.doc | [] | [
"ABS_rule",
"STRING",
"extends",
"thm_seq",
"thm_thy"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
INST_TYPE : (STRING → TYPE) → THM → THM → BOOL
----
tysubs old_thm new_thm •
INST_TYPE tysubs old_thm new_thm =
let old_seq = thm_seq old_thm in let old_thy = thm_thy old_thm
in let new_seq = thm_seq new_thm in let new_thy = thm_thy new_thm
in
INST_TYPE_rule tysubs old_seq new_seq ∧
new_thy extends ... | HOLCONST | INST_TYPE | hol | src/hol/spc004.doc | [] | [
"INST_TYPE_rule",
"STRING",
"extends",
"thm_seq",
"thm_thy"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
DISCH : TERM → THM → THM → BOOL
----
tm old_thm new_thm •
DISCH tm old_thm new_thm =
let old_seq = thm_seq old_thm in let old_thy = thm_thy old_thm
in let new_seq = thm_seq new_thm in let new_thy = thm_thy new_thm
in
DISCH_rule tm old_seq new_seq ∧
new_thy extends old_thy | HOLCONST | DISCH | hol | src/hol/spc004.doc | [] | [
"DISCH_rule",
"extends",
"thm_seq",
"thm_thy"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
MP : THM → THM → THM → BOOL
----
imp_thm ant_thm new_thm •
MP imp_thm ant_thm new_thm =
let imp_seq = thm_seq imp_thm in let imp_thy = thm_thy imp_thm
in let ant_seq = thm_seq ant_thm in let ant_thy = thm_thy ant_thm
in let new_seq = thm_seq new_thm in let new_thy = thm_thy new_thm
in
MP_rule imp_seq a... | HOLCONST | MP | hol | src/hol/spc004.doc | [] | [
"MP_rule",
"extends",
"thm_seq",
"thm_thy"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
ASSUME : TERM → THM → BOOL
----
tm thm • ASSUME tm thm = ASSUME_axiom tm (thm_seq thm) | HOLCONST | ASSUME | hol | src/hol/spc004.doc | [] | [
"ASSUME_axiom",
"thm_seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
REFL : TERM → THM → BOOL
----
tm thm • REFL tm thm = ((thm_seq thm) = REFL_axiom tm) | HOLCONST | REFL | hol | src/hol/spc004.doc | [] | [
"REFL_axiom",
"thm_seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
BETA_CONV : TERM → THM → BOOL
----
tm thm • BETA_CONV tm thm = BETA_CONV_axiom tm (thm_seq thm) | HOLCONST | BETA_CONV | hol | src/hol/spc004.doc | [] | [
"BETA_CONV_axiom",
"thm_seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
wf_hierarchy : THEORY_HIERARCHY_REP SET
----
hier •
hier wf_hierarchy ¤
thyn • Fst(Snd(hier thyn)) axioms (Fst(hier thyn))
∧ Snd(Snd(hier thyn)) sequents (Fst(hier thyn)) | HOLCONST | wf_hierarchy | hol | src/hol/spc004.doc | [] | [
"axioms",
"sequents"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
th_theory : THEORY_HIERARCHY → STRING → THEORY
----
hier thyn •
th_theory hier thyn = Fst((rep_theory_hierarchy hier) thyn) | HOLCONST | th_theory | hol | src/hol/spc004.doc | [] | [
"STRING"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
th_theories : THEORY_HIERARCHY → (THEORY SET)
----
hier thy •
thy th_theories hier ¤ thyn • th_theory hier thyn = thy | HOLCONST | th_theories | hol | src/hol/spc004.doc | [] | [
"th_theory"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
th_definitions : THEORY_HIERARCHY → STRING → (SEQ SET)
----
hier thyn seq •
seq th_definitions hier thyn
¤ seq Fst(Snd((rep_theory_hierarchy hier) thyn)) | HOLCONST | th_definitions | hol | src/hol/spc004.doc | [] | [
"STRING",
"seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
th_theorems : THEORY_HIERARCHY → STRING → (SEQ SET)
----
hier thyn seq •
seq th_theorems hier thyn
¤ seq Snd(Snd((rep_theory_hierarchy hier) thyn)) | HOLCONST | th_theorems | hol | src/hol/spc004.doc | [] | [
"STRING",
"seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
valid_hierarchy : 'U → THEORY_HIERARCHY SET
----
(v:'U) hier •
hier valid_hierarchy v ¤
thyn • th_theorems hier thyn valid v (th_theory hier thyn) | HOLCONST | valid_hierarchy | hol | src/hol/spc004.doc | [] | [
"th_theorems",
"th_theory",
"valid"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
validity_preserving : 'U → ('INPUT, 'OUTPUT, 'STATE)HOL_SYSTEM SET
----
(v:'U) tr_f int •
(tr_f, int) validity_preserving v ¤
input st •
int st valid_hierarchy v ⇒ int(Fst(tr_f(input, st))) valid_hierarchy v | HOLCONST | validity_preserving | hol | src/hol/spc004.doc | [] | [
"valid_hierarchy"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
derivable_hierarchy : THEORY_HIERARCHY SET
----
hier •
hier derivable_hierarchy ¤
thyn seq • seq th_theorems hier thyn
⇒ derivable_from seq (axioms(th_theory hier thyn)) | HOLCONST | derivable_hierarchy | hol | src/hol/spc004.doc | [] | [
"axioms",
"derivable_from",
"seq",
"th_theorems",
"th_theory"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
derivability_preserving : ('INPUT, 'OUTPUT, 'STATE)HOL_SYSTEM SET
----
tr_f int •
(tr_f, int) derivability_preserving ¤
input st •
int st derivable_hierarchy ⇒ int(Fst(tr_f(input, st))) derivable_hierarchy | HOLCONST | derivability_preserving | hol | src/hol/spc004.doc | [] | [
"derivable_hierarchy"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
standard : ('INPUT, 'OUTPUT, 'STATE)HOL_SYSTEM SET
----
tr_f int •
(tr_f, int) standard ¤
input st new_thyn • old_thyn thy tms •
let old_thy = th_theory (int st) old_thyn
in let old_defs = th_definitions (int st) old_thyn
in let new_thy = th_theory(int(Fst(tr_f(input, st))))new_thyn
in let new_defs = th_def... | HOLCONST | standard | hol | src/hol/spc004.doc | [] | [
"axioms",
"definitional_extension",
"new_axioms",
"th_definitions",
"th_theory"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
initial_dict : ('X)DICT
----
initial_dict = {} | HOLCONST | initial_dict | hol | src/hol/spc005.doc | [] | [] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
enter : STRING → 'X → ('X)DICT → ('X)DICT
----
key item dict • enter key item dict = dict « {(key, item)} | HOLCONST | enter | hol | src/hol/spc005.doc | [] | [
"STRING"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
lookup : STRING → ('X)DICT → 'X → BOOL
----
key dict item •
lookup key dict item ¤ (key, item) dict | HOLCONST | lookup | hol | src/hol/spc005.doc | [] | [
"STRING"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
delete : STRING → ('X)DICT → ('X)DICT
----
key dict • delete key dict = {key} á dict | HOLCONST | delete | hol | src/hol/spc005.doc | [] | [
"STRING"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
block_delete : ('X SET) → ('X)DICT → ('X)DICT
----
a dict • block_delete a dict = dict a | HOLCONST | block_delete | hol | src/hol/spc005.doc | [] | [] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
keys : ('X)DICT → STRING SET
----
keys = Dom | HOLCONST | keys | hol | src/hol/spc005.doc | [] | [
"Dom",
"STRING"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
fetch : ('X)ADDR → ('X)STORE → 'X → BOOL
----
addr st value • fetch addr st value ¤ (addr, value) st | HOLCONST | fetch | hol | src/hol/spc005.doc | [] | [
"value"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new : 'X → ('X)STORE → (('X)STORE × ('X)ADDR) → BOOL
----
value st1 st2 addr •
new value st1 (st2, addr) ¤
³addr Dom st1
∧ st2 = st1 « {(addr, value)} | HOLCONST | new | hol | src/hol/spc005.doc | [] | [
"Dom",
"value"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
initial_store : ('X)STORE
----
initial_store = {} | HOLCONST | initial_store | hol | src/hol/spc005.doc | [] | [] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
THEORY_CONTENTS
tc_name : STRING;
tc_ty_env : (î × î) DICT;
tc_con_env : (TYPE × î) DICT;
tc_parents : STRING LIST;
tc_axiom_dict : (SEQ × î) DICT;
tc_definition_dict : (SEQ × î) DICT;
tc_theorem_dict : (SEQ × î) DICT;
tc_current_level : î;
tc_deleted_levels : î SET;
tc_user_data : 'UD | HOLLABPROD | THEORY_CONTENTS | hol | src/hol/spc005.doc | [] | [
"STRING"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
TSNormal : STATUS;
TSLocked : STATUS;
TSAncestor : STATUS;
TSDeleted : STATUS
----
[TSNormal; TSLocked; TSAncestor; TSDeleted] Distinct | HOLCONST | TSNormal | hol | src/hol/spc005.doc | [] | [
"Distinct"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
THEORY_INFO
ti_status : STATUS;
ti_inscope : BOOL;
ti_contents : (('UD)THEORY_CONTENTS)ADDR | HOLLABPROD | THEORY_INFO | hol | src/hol/spc005.doc | [] | [
"THEORY_CONTENTS"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
PDS_THM
pt_theory : (('UD)THEORY_CONTENTS)ADDR;
pt_level : î;
pt_sequent : SEQ | HOLLABPROD | PDS_THM | hol | src/hol/spc005.doc | [] | [
"THEORY_CONTENTS"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
PDS_STATE
ps_current_theory : (('UD)THEORY_CONTENTS)ADDR;
ps_current_hierarchy : (('UD)HIERARCHY)ADDR;
ps_theory_store : (('UD)THEORY_CONTENTS)STORE;
ps_hierarchy_store : (('UD)HIERARCHY) STORE;
ps_theorem_store : (('UD)PDS_THM) STORE | HOLLABPROD | PDS_STATE | hol | src/hol/spc005.doc | [] | [
"PDS_THM",
"THEORY_CONTENTS"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
initial_theory : 'UD →
( (('UD)THEORY_CONTENTS)STORE)
× ('UD)THEORY_INFO
----
ud • initial_theory ud =
let contents = MkTHEORY_CONTENTS
"MIN"
initial_dict initial_dict
[]
initial_dict initial_dict initial_dict
0 {}
ud
in let (st, addr) = Å(st, addr) • new contents initial_store (st,... | HOLCONST | initial_theory | hol | src/hol/spc005.doc | [] | [
"MIN",
"THEORY_CONTENTS",
"THEORY_INFO",
"TSNormal",
"initial_dict",
"initial_store",
"new"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
initial_state : 'UD → ('UD)PDS_STATE
----
ud • initial_state ud =
let (thy_st, thy_info) = initial_theory ud
in let (hier_st, hier_addr) = Å(st, addr) • new [thy_info] initial_store (st, addr)
in MkPDS_STATE (ti_contents thy_info) hier_addr thy_st hier_st initial_store | HOLCONST | initial_state | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"initial_store",
"initial_theory",
"new"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
theory_contents : ('UD)PDS_STATE → STRING →
('UD)THEORY_CONTENTS → BOOL
----
state name thy_c • theory_contents state name thy_c ¤
let thy_st = ps_theory_store state
in let hier_st = ps_hierarchy_store state
in let cur_hier = ps_current_hierarchy state
in let infos = Åx • fetch cur_hier hier_st x
... | HOLCONST | theory_contents | hol | src/hol/spc005.doc | [] | [
"Elems",
"PDS_STATE",
"STRING",
"THEORY_CONTENTS",
"fetch"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
theory_names : ('UD)PDS_STATE → STRING SET
----
state name • name theory_names state ¤
thy_c • theory_contents state name thy_c | HOLCONST | theory_names | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"STRING",
"theory_contents"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
theory_ancestors : ('UD)PDS_STATE → STRING → STRING SET
----
state name • theory_ancestors state name = ¥{P:STRING SET |
(name theory_names state ⇒ name P)
∧ (anc1 thy_c anc2 •
anc1 P
∧ theory_contents state anc1 thy_c
∧ anc2 Elems (tc_parents thy_c)
⇒ anc2 P)} | HOLCONST | theory_ancestors | hol | src/hol/spc005.doc | [] | [
"Elems",
"PDS_STATE",
"STRING",
"theory_contents",
"theory_names"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
interpret_theory_contents : (('UD)THEORY_CONTENTS SET) →
(THEORY × (SEQ SET) × (SEQ SET))
----
thy_cs • interpret_theory_contents thy_cs = (
abs_theory(
{(tyn, arity) | thy_c lev • thy_c thy_cs
∧ lookup tyn (tc_ty_env thy_c) (arity, lev)},
{(cn, ty) | thy_c lev • thy_c thy_cs
∧ looku... | HOLCONST | interpret_theory_contents | hol | src/hol/spc005.doc | [] | [
"THEORY_CONTENTS",
"lookup",
"seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
interpret_state : ('UD)PDS_STATE → THEORY_HIERARCHY
----
state • interpret_state state = mk_theory_hierarchy( ⇔ thyn •
interpret_theory_contents {tc | anc •
anc theory_ancestors state thyn
∧ theory_contents state anc tc}) | HOLCONST | interpret_state | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"interpret_theory_contents",
"theory_ancestors",
"theory_contents"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
dest_state : ('UD)PDS_STATE →
( ('UD)THEORY_CONTENTS ADDR
× ('UD)HIERARCHY ADDR
× ('UD) THEORY_CONTENTS STORE
× ('UD)HIERARCHY STORE
× ('UD)PDS_THM STORE )
----
state • dest_state state = (
ps_current_theory state,
ps_current_hierarchy state,
ps_theory_store state,
ps_hierarchy_store stat... | HOLCONST | dest_state | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"PDS_THM",
"THEORY_CONTENTS"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
dest_theory_contents : ('UD)THEORY_CONTENTS →
( STRING
× (î × î) DICT
× (TYPE × î) DICT
× STRING LIST
× (SEQ × î) DICT
× (SEQ × î) DICT
× (SEQ × î) DICT
× î
× î SET
× 'UD )
----
tc • dest_theory_contents tc = (
tc_name tc,
tc_ty_env tc,
tc_con_env tc,
tc_pare... | HOLCONST | dest_theory_contents | hol | src/hol/spc005.doc | [] | [
"STRING",
"THEORY_CONTENTS"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
current_theory_contents : ('UD)PDS_STATE →
('UD)THEORY_CONTENTS
----
state • current_theory_contents state =
let (cur_thy, _1, thy_st, _2, _3) = dest_state state
in (Åtc • fetch cur_thy thy_st tc) | HOLCONST | current_theory_contents | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"THEORY_CONTENTS",
"dest_state",
"fetch"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
current_theory_name : ('UD)PDS_STATE → STRING
----
state • current_theory_name state =
tc_name(current_theory_contents state) | HOLCONST | current_theory_name | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"STRING",
"current_theory_contents"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
current_abstract_theory : ('UD)PDS_STATE → THEORY
----
state • current_abstract_theory state = Fst(interpret_theory_contents{tc| anc •
anc theory_ancestors state (current_theory_name state)
∧ theory_contents state anc tc}) | HOLCONST | current_abstract_theory | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"current_theory_name",
"interpret_theory_contents",
"theory_ancestors",
"theory_contents"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
theory_info : ('UD)PDS_STATE → STRING → ('UD) THEORY_INFO
----
state name • theory_info state name =
let (cur_thy, cur_hier, thy_st, hier_st, _1) = dest_state state
in let hier = Åh • fetch cur_hier hier_st h
in Åti • tc_name(Åtc • fetch (ti_contents ti) thy_st tc) = name
∧ ³ti_status ti = TSDeleted | HOLCONST | theory_info | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"STRING",
"THEORY_INFO",
"dest_state",
"fetch"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
current_theory_status : ('UD)PDS_STATE → STATUS
----
state • current_theory_status state =
ti_status (theory_info state (current_theory_name state)) | HOLCONST | current_theory_status | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"current_theory_name",
"theory_info"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
check_thm : ('UD)PDS_STATE → ('UD)PDS_THM → BOOL
----
state thm • check_thm state thm ¤
let (cur_thy, cur_hier, thy_st, hier_st, _1) = dest_state state
in let tc = Åtc • fetch (pt_theory thm) thy_st tc
in let ti = theory_info state (tc_name tc)
in ( pt_theory thm = ti_contents ti
∧ ti_inscope ti
∧ ³pt_... | HOLCONST | check_thm | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"PDS_THM",
"dest_state",
"fetch",
"theory_info"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
check_thm_address : ('UD)PDS_STATE → ('UD)PDS_THM ADDR → BOOL
----
state thm_ad • check_thm_address state thm_ad ¤
let (_1, _2, _3, _4, thm_st) = dest_state state
in thm • fetch thm_ad thm_st thm ∧ check_thm state thm | HOLCONST | check_thm_address | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"PDS_THM",
"check_thm",
"dest_state",
"fetch"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
fetch_thms :
('UD)PDS_STATE → ('UD)PDS_THM ADDR LIST → ('UD)PDS_THM LIST
----
state thm_ads • fetch_thms state thm_ads =
let (_1, _2, _3, _4, thm_st) = dest_state state
in Map ( ⇔ a • Åthm • fetch a thm_st thm) thm_ads | HOLCONST | fetch_thms | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"PDS_THM",
"dest_state",
"fetch"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
hierarchy_ancestor : ('UD)PDS_STATE →
(('UD)HIERARCHY)ADDR →
(('UD)HIERARCHY)ADDR → BOOL
----
state hier_ad1 hier_ad2 • hierarchy_ancestor state hier_ad1 hier_ad2 ¤
let (_1, cur_hier, _2, hier_st, _3) = dest_state state
in h1 h2 •
fetch hier_ad1 hier_st h1 ∧ fetch hier_ad2 hier_st h2
⇒ Elems (M... | HOLCONST | hierarchy_ancestor | hol | src/hol/spc005.doc | [] | [
"Elems",
"PDS_STATE",
"dest_state",
"fetch"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
pds_mk_thm : ('UD)PDS_STATE → SEQ → ('UD)PDS_THM
----
state seq • pds_mk_thm state seq =
let cur_thy = ps_current_theory state
in let lev = tc_current_level (current_theory_contents state)
in MkPDS_THM cur_thy lev seq | HOLCONST | pds_mk_thm | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"PDS_THM",
"current_theory_contents",
"seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
make_current : STRING → ('UD)PDS_STATE → ('UD)PDS_STATE
----
thyn state • make_current thyn state =
let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_state state
in let f1 = ⇔ ti • tc_name(Åtc • fetch (ti_contents ti) thy_st tc)
in let f2 = ⇔ ti • (f1 ti) theory_ancestors state thyn
in let f3 = ⇔ t... | HOLCONST | make_current | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"STRING",
"dest_state",
"fetch",
"theory_ancestors",
"theory_info"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
freeze_hierarchy : ('UD)PDS_STATE → ('UD)PDS_STATE
----
state • freeze_hierarchy state =
let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_state state
in let f1 = ⇔ n • if n = TSDeleted then n else TSAncestor
in let f2 = ⇔ ti • MkTHEORY_INFO(f1(ti_status ti))(ti_inscope ti)(ti_contents ti)
in let hier'... | HOLCONST | freeze_hierarchy | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"dest_state",
"fetch"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_hierarchy : ('UD)PDS_STATE → ('UD)PDS_STATE
----
state • new_hierarchy state =
let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_state state
in let hier = Åh • fetch cur_hier hier_st h
in
if ( ti • ti Elems hier
∧ ³ti_status ti {TSAncestor; TSDeleted})
then state
else let (hier_st', cur_hier'... | HOLCONST | new_hierarchy | hol | src/hol/spc005.doc | [] | [
"Elems",
"PDS_STATE",
"dest_state",
"fetch",
"new"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
load_hierarchy : (('UD)HIERARCHY)ADDR →
('UD)PDS_STATE → ('UD)PDS_STATE
----
hier state • load_hierarchy hier state =
let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_state state
in
if ³(hierarchy_ancestor state cur_hier hier)
then state
else let cur_thyn = current_theory_name state
in let st' =... | HOLCONST | load_hierarchy | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"current_theory_name",
"dest_state",
"hierarchy_ancestor",
"make_current"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
open_theory : STRING → ('UD)PDS_STATE → ('UD)PDS_STATE
----
thyn state • open_theory thyn state =
if ³thyn theory_names state ² ti_status(theory_info state thyn) = TSDeleted
then state
else make_current thyn state | HOLCONST | open_theory | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"STRING",
"make_current",
"theory_info",
"theory_names"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
empty_theory :
STRING → (STRING LIST) → 'UD → ('UD) THEORY_CONTENTS
----
thyn pars ud • empty_theory thyn pars ud =
MkTHEORY_CONTENTS
thyn
initial_dict initial_dict
pars
initial_dict initial_dict initial_dict
0 {}
ud | HOLCONST | empty_theory | hol | src/hol/spc005.doc | [] | [
"STRING",
"THEORY_CONTENTS",
"initial_dict"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
arbitrary_ud : 'UD
----
T | HOLCONST | arbitrary_ud | hol | src/hol/spc005.doc | [] | [] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
delete_theory : STRING → ('UD)PDS_STATE → ('UD)PDS_STATE
----
thyn state • delete_theory thyn state =
if ³thyn theory_names state
² ³ti_status(theory_info state thyn) = TSNormal
² ti_inscope(theory_info state thyn)
² childname tc • theory_contents state childname tc
∧ thyn Elems (tc_parents tc)
then ... | HOLCONST | delete_theory | hol | src/hol/spc005.doc | [] | [
"Elems",
"PDS_STATE",
"STRING",
"TSNormal",
"arbitrary_ud",
"dest_state",
"empty_theory",
"fetch",
"theory_contents",
"theory_info",
"theory_names"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_theory : STRING → 'UD → ('UD)PDS_STATE →
('UD)PDS_STATE
----
thyn ud state • new_theory thyn ud state=
if thyn theory_names state
then state
else let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_state state
in let thy = empty_theory thyn [current_theory_name state] ud
in let (thy_st', addr... | HOLCONST | new_theory | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"STRING",
"TSNormal",
"current_theory_name",
"dest_state",
"empty_theory",
"fetch",
"new",
"theory_names"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
new_parent : STRING → ('UD)PDS_STATE →
('UD)PDS_STATE
----
thyn state • new_parent thyn state=
if ³thyn theory_names state
² thyn Elems(tc_parents (current_theory_contents state))
² ancn • ancn (theory_ancestors state thyn
\ theory_ancestors state (current_theory_name state))
∧ let anc = Åanc •... | HOLCONST | new_parent | hol | src/hol/spc005.doc | [] | [
"Dom",
"Elems",
"PDS_STATE",
"STRING",
"constants",
"current_abstract_theory",
"current_theory_contents",
"current_theory_name",
"dest_state",
"dest_theory_contents",
"fetch",
"lookup",
"theory_ancestors",
"theory_contents",
"theory_names",
"types"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
duplicate_theory : STRING → STRING → ('UD)PDS_STATE →
('UD)PDS_STATE
----
thyn copyn state • duplicate_theory thyn copyn state =
if ³thyn theory_names state
² copyn theory_names state
² thyn = "MIN"
then state
else let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_state state
in let tc = ... | HOLCONST | duplicate_theory | hol | src/hol/spc005.doc | [] | [
"MIN",
"PDS_STATE",
"STRING",
"TSNormal",
"dest_state",
"dest_theory_contents",
"fetch",
"new",
"theory_contents",
"theory_names"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
lock_theory : STRING → ('UD)PDS_STATE → ('UD)PDS_STATE
----
thyn state • lock_theory thyn state =
if ³thyn theory_names state
² ³ti_status(theory_info state thyn) = TSNormal
then state
else let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_state state
in let ti = theory_info state thyn
in let f = ... | HOLCONST | lock_theory | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"STRING",
"TSNormal",
"dest_state",
"fetch",
"theory_info",
"theory_names"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
unlock_theory : STRING → ('UD)PDS_STATE → ('UD)PDS_STATE
----
thyn state • unlock_theory thyn state =
if ³thyn theory_names state
² ³ti_status(theory_info state thyn) = TSLocked
then state
else let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_state state
in let ti = theory_info state thyn
in let ... | HOLCONST | unlock_theory | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"STRING",
"TSNormal",
"dest_state",
"fetch",
"theory_info",
"theory_names"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
save_thm : STRING → ('UD)PDS_THM →
('UD)PDS_STATE → ('UD)PDS_STATE
----
key thm state • save_thm key thm state =
let tc = current_theory_contents state
in
if key keys (tc_theorem_dict tc)
² ³current_theory_status state = TSNormal
² ³check_thm state thm
then state
else let (cur_thy, cur_hier, thy_st, h... | HOLCONST | save_thm | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"PDS_THM",
"STRING",
"TSNormal",
"check_thm",
"current_theory_contents",
"current_theory_status",
"dest_state",
"dest_theory_contents",
"enter",
"keys"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
is_latest_level : ('UD)PDS_STATE → î → BOOL
----
state lev • is_latest_level state lev ¤
let tc = current_theory_contents state
in let (nm, t_e, c_e, pars, ax_d, def_d, thm_d, lev, x_levs, ud) =
dest_theory_contents tc
in let present = {lv| ( _1 key • lookup key t_e (_1, lv))
² ( _1 key • lookup k... | HOLCONST | is_latest_level | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"current_theory_contents",
"dest_theory_contents",
"lookup"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
delete_extension : ('UD)PDS_STATE → ('UD)PDS_STATE
----
state • delete_extension state =
let tc = current_theory_contents state
in
if (³( lev • is_latest_level state lev)
² ( childname tc • theory_contents state childname tc
∧ current_theory_name state Elems (tc_parents tc))
² ³current_theory_status stat... | HOLCONST | delete_extension | hol | src/hol/spc005.doc | [] | [
"Elems",
"PDS_STATE",
"TSNormal",
"block_delete",
"current_theory_contents",
"current_theory_name",
"current_theory_status",
"dest_state",
"dest_theory_contents",
"is_latest_level",
"theory_contents"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
delete_thm : STRING →
('UD)PDS_STATE → ('UD)PDS_STATE
----
key state • delete_thm key state =
let tc = current_theory_contents state
in
if ³key keys (tc_theorem_dict tc)
² ³current_theory_status state = TSNormal
then state
else let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_state state
in let ... | HOLCONST | delete_thm | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"STRING",
"TSNormal",
"current_theory_contents",
"current_theory_status",
"delete",
"dest_state",
"dest_theory_contents",
"keys"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
pds_new_axiom : TERM → STRING →
('UD)PDS_STATE → ('UD)PDS_STATE
----
tm key state • pds_new_axiom tm key state =
let tc = current_theory_contents state
in let seq = ({}, tm)
in
if key keys (tc_axiom_dict tc)
² ³seq sequents (current_abstract_theory state)
² ³current_theory_status state = TSNormal
the... | HOLCONST | pds_new_axiom | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"STRING",
"TSNormal",
"current_abstract_theory",
"current_theory_contents",
"current_theory_status",
"dest_state",
"dest_theory_contents",
"enter",
"keys",
"new",
"pds_mk_thm",
"seq",
"sequents"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
make_definition : ('IP, 'UD)DEFINER →
(('IP, 'UD)PDS_INPUT × ('UD)PDS_STATE) →
('UD)PDS_STATE
----
definer pars thm_ads state •
make_definition definer ((pars, thm_ads), state) =
if thm_ad • thm_ad Elems thm_ads ∧ ³check_thm_address state thm_ad
then state
else let thms = fetch_thms state thm_ads... | HOLCONST | make_definition | hol | src/hol/spc005.doc | [] | [
"Dom",
"Elems",
"PDS_STATE",
"check_thm_address",
"current_theory_contents",
"dest_state",
"dest_theory_contents",
"enter",
"fetch_thms",
"new",
"pds_mk_thm",
"seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
pds_new_type : STRING → î → ('UD)PDS_STATE →
('UD)PDS_STATE
----
ty arity state •
pds_new_type ty arity state =
if ty Dom(types (current_abstract_theory state))
then state
else let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_state state
in let tc = current_theory_contents state
in let (nm, ... | HOLCONST | pds_new_type | hol | src/hol/spc005.doc | [] | [
"Dom",
"PDS_STATE",
"STRING",
"current_abstract_theory",
"current_theory_contents",
"dest_state",
"dest_theory_contents",
"enter",
"types"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
pds_new_constant : STRING → TYPE → ('UD)PDS_STATE →
('UD)PDS_STATE
----
con ty state •
pds_new_constant con ty state =
if con Dom(constants (current_abstract_theory state))
² ³ty wf_type (types (current_abstract_theory state))
then state
else let (cur_thy, cur_hier, thy_st, hier_st, thm_st) = dest_st... | HOLCONST | pds_new_constant | hol | src/hol/spc005.doc | [] | [
"Dom",
"PDS_STATE",
"STRING",
"constants",
"current_abstract_theory",
"current_theory_contents",
"dest_state",
"dest_theory_contents",
"enter",
"types",
"wf_type"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
make_inference : ('IP, 'UD)INFERRER →
(('IP, 'UD)PDS_INPUT × ('UD)PDS_STATE) →
('UD)PDS_STATE
----
inferrer pars thm_ads state •
make_inference inferrer ((pars, thm_ads), state) =
if ( thm_ad • thm_ad Elems thm_ads ∧ ³check_thm_address state thm_ad)
then state
else let thms = fetch_thms state thm_... | HOLCONST | make_inference | hol | src/hol/spc005.doc | [] | [
"Dom",
"Elems",
"PDS_STATE",
"TSNormal",
"check_thm_address",
"current_theory_status",
"dest_state",
"fetch_thms",
"new",
"pds_mk_thm",
"seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
allowed : ('IP, 'UD)DEFINER →
('IP, 'UD)INFERRER →
( ('UD)PDS_STATE → ('UD)PDS_STATE ) → BOOL
----
definer inferrer trans •
allowed definer inferrer trans ¤
trans = freeze_hierarchy
² trans = new_hierarchy
² addr • trans = load_hierarchy addr
² thyn • trans = open_theory thyn
² thyn • trans = d... | HOLCONST | allowed | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"delete_extension",
"delete_theory",
"delete_thm",
"duplicate_theory",
"freeze_hierarchy",
"load_hierarchy",
"lock_theory",
"make_definition",
"make_inference",
"new_hierarchy",
"new_parent",
"new_theory",
"open_theory",
"pds_new_axiom",
"pds_new_constant",
"pds_new_type... | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
pds : ('IP, 'UD)DEFINER →
('IP, 'UD)INFERRER →
('IP, 'UD)INTERPRETER →
( ('IP, 'UD)PDS_INPUT,
('UD)PDS_THM STORE,
('UD)PDS_STATE )HOL_SYSTEM
----
definer inferrer interpreter •
pds definer inferrer interpreter =
( ( ⇔ ((pars, thm_ads), state) •
let state' = interpreter definer inferrer (pars, thm... | HOLCONST | pds | hol | src/hol/spc005.doc | [] | [
"PDS_STATE",
"PDS_THM",
"interpret_state"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
good_definer : ('IP, 'UD)DEFINER → BOOL
----
definer • good_definer definer ¤
pars thms state •
((pars, thms), state) Dom definer
⇒ let thy = current_abstract_theory state
in let (tyenv, conenv, axs) = rep_theory thy
in let (seq, tys, cons, _1) = definer@((pars, thms), state)
in let tyenv' = Fold ( ⇔ ... | HOLCONST | good_definer | hol | src/hol/spc005.doc | [] | [
"Dom",
"current_abstract_theory",
"definitional_extension",
"seq"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
good_inferrer : 'U → ('IP, 'UD)INFERRER → BOOL
----
v inferrer • good_inferrer v inferrer ¤
pars thms state •
((pars, thms), state) Dom inferrer
⇒ let thy = current_abstract_theory state
in let seq = inferrer@((pars, thms), state)
in ( seq sequents thy
∧ seq valid v thy) | HOLCONST | good_inferrer | hol | src/hol/spc005.doc | [] | [
"Dom",
"current_abstract_theory",
"seq",
"sequents",
"valid"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
good_interpreter : ('IP, 'UD)INTERPRETER → BOOL
----
interpreter • good_interpreter interpreter ¤
definer inferrer pars thm_ads •
allowed definer inferrer(interpreter definer inferrer(pars, thm_ads)) | HOLCONST | good_interpreter | hol | src/hol/spc005.doc | [] | [
"allowed"
] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f | ||
VM_State
takings : î;
stock : î;
price : î;
cash_tendered : î | HOLLABPROD | VM_State | hol | src/hol/usr013H.doc | [] | [] | https://github.com/RobArthan/pp | dabebf8fdbdede1a3ad6333500c6663ecd15c98f |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.