Theorems · Inductive type · logic and foundations
Turing.TM2.Cfg
{K : Type u_1} → (K → Type u_2) → Type u_3 → Type u_4 → Type (max (max (max u_1 u_2) u_3) u_4)A configuration in the TM2 model is a label (or none for the halt state), the state of
local variables, and the stacks. (Note that the stacks are not ListBlanks, they have a definite
size.)
- Cited by
- 22 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by41
Results whose statement or proof uses this declaration.
- Turing.TM2.stepstatement and proof · cited by 17
- Turing.TM2.stepAuxstatement · cited by 15
- Turing.PartrecToTM2.move_okstatement and proof · cited by 5
- Turing.TM2to1.TrCfgstatement · cited by 4
- Turing.PartrecToTM2.Cfg'proof · cited by 4
- Turing.PartrecToTM2.clear_okstatement and proof · cited by 4
- Turing.PartrecToTM2.unrev_okstatement · cited by 4
- Turing.TM2.stepAux.eq_defstatement and proof · cited by 2
- Turing.TM2to1.tr_respectsstatement and proof · cited by 2
- Turing.TM2.evalproof · cited by 2
- Turing.TM2.initstatement · cited by 2
- Turing.TM2to1.TrCfg.casesOnstatement and proof · cited by 2