Theorems · Definition · logic and foundations
Turing.ToPartrec.Code.Ok
Turing.ToPartrec.Code → Prop
This is a temporary definition, because we will prove in code_is_ok that it always holds.
It asserts that c is semantically correct; that is, for any k and v,
eval (stepNormal c k v) = eval (Cfg.ret k (Code.eval c v)), as an equality of partial values
(so one diverges iff the other does).
In particular, we can let k = Cont.halt, and then this asserts that stepNormal c Cont.halt v
evaluates to Cfg.halt (Code.eval c v).
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Turing.ToPartrec.Codestatement and proof · cited by 83
- Turing.ToPartrec.Contproof · cited by 33
- Turing.ToPartrec.Code.evalproof · cited by 23
- StateTransition.evalproof · cited by 16
- Turing.ToPartrec.stepNormalproof · cited by 13
- Turing.ToPartrec.stepproof · cited by 7
Cited by3
Results whose statement or proof uses this declaration.
- Turing.ToPartrec.code_is_okstatement and proof · cited by 2
- Turing.ToPartrec.cont_eval_fixstatement and proof · cited by 2
- Turing.ToPartrec.Code.Ok.zerostatement and proof · cited by 1