Theorems · Inductive type · logic and foundations
Turing.ToPartrec.Code
Type
The type of codes for primitive recursive functions. Unlike Nat.Partrec.Code, this uses a set
of operations on List ℕ. See Code.eval for a description of the behavior of the primitives.
- Cited by
- 83 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 by149
Results whose statement or proof uses this declaration.
- Turing.PartrecToTM2.trproof · cited by 33
- Turing.ToPartrec.Code.evalstatement and proof · cited by 23
- Turing.PartrecToTM2.trNormalstatement and proof · cited by 23
- Turing.PartrecToTM2.codeSuppstatement and proof · cited by 16
- Turing.PartrecToTM2.codeSupp'statement and proof · cited by 13
- Turing.ToPartrec.stepNormalstatement and proof · cited by 13
- Turing.ToPartrec.Cont.brecOn.goproof · cited by 6
- Turing.ToPartrec.Cont.belowproof · cited by 6
- Turing.ToPartrec.Code.brecOn.gostatement and proof · cited by 5
- Turing.ToPartrec.Cont.brecOn.eqproof · cited by 5
- Turing.ToPartrec.Code.belowstatement and proof · cited by 5
- Turing.ToPartrec.Code.nilstatement · cited by 5