Loogle!
Result
Found 31 declarations mentioning Turing.PartrecToTM2.tr.
- Turing.PartrecToTM2.tr ๐ Mathlib.Computability.TuringMachine.ToPartrec
: Turing.PartrecToTM2.ฮ' โ Turing.PartrecToTM2.Stmt' - Turing.PartrecToTM2.tr_read ๐ Mathlib.Computability.TuringMachine.ToPartrec
(q : Option Turing.PartrecToTM2.ฮ' โ Turing.PartrecToTM2.ฮ') : Turing.PartrecToTM2.tr (Turing.PartrecToTM2.ฮ'.read q) = Turing.TM2.Stmt.goto q - Turing.PartrecToTM2.tr_supports ๐ Mathlib.Computability.TuringMachine.ToPartrec
(c : Turing.ToPartrec.Code) (k : Turing.PartrecToTM2.Cont') : Turing.TM2.Supports Turing.PartrecToTM2.tr (Turing.PartrecToTM2.codeSupp c k) - Turing.PartrecToTM2.tr_respects ๐ Mathlib.Computability.TuringMachine.ToPartrec
: StateTransition.Respects Turing.ToPartrec.step (Turing.TM2.step Turing.PartrecToTM2.tr) Turing.PartrecToTM2.TrCfg - Turing.PartrecToTM2.tr_ret_consโ ๐ Mathlib.Computability.TuringMachine.ToPartrec
(k : Turing.PartrecToTM2.Cont') : Turing.PartrecToTM2.tr (Turing.PartrecToTM2.ฮ'.ret k.consโ) = Turing.TM2.Stmt.goto fun x => Turing.PartrecToTM2.head Turing.PartrecToTM2.K'.stack (Turing.PartrecToTM2.ฮ'.ret k) - Turing.PartrecToTM2.tr_ret_comp ๐ Mathlib.Computability.TuringMachine.ToPartrec
(f : Turing.ToPartrec.Code) (k : Turing.PartrecToTM2.Cont') : Turing.PartrecToTM2.tr (Turing.PartrecToTM2.ฮ'.ret (Turing.PartrecToTM2.Cont'.comp f k)) = Turing.TM2.Stmt.goto fun x => Turing.PartrecToTM2.trNormal f k - Turing.PartrecToTM2.supports_singleton ๐ Mathlib.Computability.TuringMachine.ToPartrec
{S : Finset Turing.PartrecToTM2.ฮ'} {q : Turing.PartrecToTM2.ฮ'} : Turing.PartrecToTM2.Supports {q} S โ Turing.TM2.SupportsStmt S (Turing.PartrecToTM2.tr q) - Turing.PartrecToTM2.tr_ret_halt ๐ Mathlib.Computability.TuringMachine.ToPartrec
: Turing.PartrecToTM2.tr (Turing.PartrecToTM2.ฮ'.ret Turing.PartrecToTM2.Cont'.halt) = Turing.TM2.Stmt.load (fun x => none) Turing.TM2.Stmt.halt - Turing.PartrecToTM2.ret_supports ๐ Mathlib.Computability.TuringMachine.ToPartrec
{S : Finset Turing.PartrecToTM2.ฮ'} {k : Turing.PartrecToTM2.Cont'} (Hโ : Turing.PartrecToTM2.contSupp k โ S) : Turing.TM2.SupportsStmt S (Turing.PartrecToTM2.tr (Turing.PartrecToTM2.ฮ'.ret k)) - Turing.PartrecToTM2.supports_insert ๐ Mathlib.Computability.TuringMachine.ToPartrec
{K S : Finset Turing.PartrecToTM2.ฮ'} {q : Turing.PartrecToTM2.ฮ'} : Turing.PartrecToTM2.Supports (insert q K) S โ Turing.TM2.SupportsStmt S (Turing.PartrecToTM2.tr q) โง Turing.PartrecToTM2.Supports K S - Turing.PartrecToTM2.tr_init ๐ Mathlib.Computability.TuringMachine.ToPartrec
(c : Turing.ToPartrec.Code) (v : List โ) : โ b, Turing.PartrecToTM2.TrCfg (Turing.ToPartrec.stepNormal c Turing.ToPartrec.Cont.halt v) b โง StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) (Turing.PartrecToTM2.init c v) b - Turing.PartrecToTM2.tr_ret_fix ๐ Mathlib.Computability.TuringMachine.ToPartrec
(f : Turing.ToPartrec.Code) (k : Turing.PartrecToTM2.Cont') : Turing.PartrecToTM2.tr (Turing.PartrecToTM2.ฮ'.ret (Turing.PartrecToTM2.Cont'.fix f k)) = Turing.PartrecToTM2.pop' Turing.PartrecToTM2.K'.main (Turing.TM2.Stmt.goto fun s => bif Turing.PartrecToTM2.natEnd (s.getD default) then Turing.PartrecToTM2.ฮ'.ret k else Turing.PartrecToTM2.ฮ'.clear Turing.PartrecToTM2.natEnd Turing.PartrecToTM2.K'.main (Turing.PartrecToTM2.trNormal f (Turing.PartrecToTM2.Cont'.fix f k))) - Turing.PartrecToTM2.tr_copy ๐ Mathlib.Computability.TuringMachine.ToPartrec
(q : Turing.PartrecToTM2.ฮ') : Turing.PartrecToTM2.tr q.copy = Turing.PartrecToTM2.pop' Turing.PartrecToTM2.K'.rev (Turing.TM2.Stmt.branch Option.isSome (Turing.PartrecToTM2.push' Turing.PartrecToTM2.K'.main (Turing.PartrecToTM2.push' Turing.PartrecToTM2.K'.stack (Turing.TM2.Stmt.goto fun x => q.copy))) (Turing.TM2.Stmt.goto fun x => q)) - Turing.PartrecToTM2.tr_ret_consโ ๐ Mathlib.Computability.TuringMachine.ToPartrec
(fs : Turing.ToPartrec.Code) (k : Turing.PartrecToTM2.Cont') : Turing.PartrecToTM2.tr (Turing.PartrecToTM2.ฮ'.ret (Turing.PartrecToTM2.Cont'.consโ fs k)) = Turing.TM2.Stmt.goto fun x => Turing.PartrecToTM2.moveโ (fun x => false) Turing.PartrecToTM2.K'.main Turing.PartrecToTM2.K'.aux (Turing.PartrecToTM2.moveโ (fun s => decide (s = Turing.PartrecToTM2.ฮ'.consโ)) Turing.PartrecToTM2.K'.stack Turing.PartrecToTM2.K'.main (Turing.PartrecToTM2.moveโ (fun x => false) Turing.PartrecToTM2.K'.aux Turing.PartrecToTM2.K'.stack (Turing.PartrecToTM2.trNormal fs k.consโ))) - Turing.PartrecToTM2.tr_eval ๐ Mathlib.Computability.TuringMachine.ToPartrec
(c : Turing.ToPartrec.Code) (v : List โ) : StateTransition.eval (Turing.TM2.step Turing.PartrecToTM2.tr) (Turing.PartrecToTM2.init c v) = Turing.PartrecToTM2.halt <$> c.eval v - Turing.PartrecToTM2.tr_clear ๐ Mathlib.Computability.TuringMachine.ToPartrec
(p : Turing.PartrecToTM2.ฮ' โ Bool) (k : Turing.PartrecToTM2.K') (q : Turing.PartrecToTM2.ฮ') : Turing.PartrecToTM2.tr (Turing.PartrecToTM2.ฮ'.clear p k q) = Turing.PartrecToTM2.pop' k (Turing.TM2.Stmt.branch (fun s => s.elim true p) (Turing.TM2.Stmt.goto fun x => q) (Turing.TM2.Stmt.goto fun x => Turing.PartrecToTM2.ฮ'.clear p k q)) - Turing.PartrecToTM2.tr_ret_respects ๐ Mathlib.Computability.TuringMachine.ToPartrec
(k : Turing.ToPartrec.Cont) (v : List โ) (s : Option Turing.PartrecToTM2.ฮ') : โ bโ, Turing.PartrecToTM2.TrCfg (Turing.ToPartrec.stepRet k v) bโ โง StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some (Turing.PartrecToTM2.ฮ'.ret (Turing.PartrecToTM2.trCont k)), var := s, stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList v) [] [] (Turing.PartrecToTM2.trContStack k) } bโ - Turing.PartrecToTM2.tr_move ๐ Mathlib.Computability.TuringMachine.ToPartrec
(p : Turing.PartrecToTM2.ฮ' โ Bool) (kโ kโ : Turing.PartrecToTM2.K') (q : Turing.PartrecToTM2.ฮ') : Turing.PartrecToTM2.tr (Turing.PartrecToTM2.ฮ'.move p kโ kโ q) = Turing.PartrecToTM2.pop' kโ (Turing.TM2.Stmt.branch (fun s => s.elim true p) (Turing.TM2.Stmt.goto fun x => q) (Turing.PartrecToTM2.push' kโ (Turing.TM2.Stmt.goto fun x => Turing.PartrecToTM2.ฮ'.move p kโ kโ q))) - Turing.PartrecToTM2.trNormal_respects ๐ Mathlib.Computability.TuringMachine.ToPartrec
(c : Turing.ToPartrec.Code) (k : Turing.ToPartrec.Cont) (v : List โ) (s : Option Turing.PartrecToTM2.ฮ') : โ bโ, Turing.PartrecToTM2.TrCfg (Turing.ToPartrec.stepNormal c k v) bโ โง StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some (Turing.PartrecToTM2.trNormal c (Turing.PartrecToTM2.trCont k)), var := s, stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList v) [] [] (Turing.PartrecToTM2.trContStack k) } bโ - Turing.PartrecToTM2.tr_push ๐ Mathlib.Computability.TuringMachine.ToPartrec
(k : Turing.PartrecToTM2.K') (f : Option Turing.PartrecToTM2.ฮ' โ Option Turing.PartrecToTM2.ฮ') (q : Turing.PartrecToTM2.ฮ') : Turing.PartrecToTM2.tr (Turing.PartrecToTM2.ฮ'.push k f q) = Turing.TM2.Stmt.branch (fun s => (f s).isSome) (Turing.TM2.Stmt.push k (fun s => (f s).getD default) (Turing.TM2.Stmt.goto fun x => q)) (Turing.TM2.Stmt.goto fun x => q) - Turing.PartrecToTM2.copy_ok ๐ Mathlib.Computability.TuringMachine.ToPartrec
(q : Turing.PartrecToTM2.ฮ') (s : Option Turing.PartrecToTM2.ฮ') (a b c d : List Turing.PartrecToTM2.ฮ') : StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some q.copy, var := s, stk := Turing.PartrecToTM2.K'.elim a b c d } { l := some q, var := none, stk := Turing.PartrecToTM2.K'.elim (b.reverseAux a) [] c (b.reverseAux d) } - Turing.PartrecToTM2.unrev_ok ๐ Mathlib.Computability.TuringMachine.ToPartrec
{q : Turing.PartrecToTM2.ฮ'} {s : Option Turing.PartrecToTM2.ฮ'} {S : Turing.PartrecToTM2.K' โ List Turing.PartrecToTM2.ฮ'} : StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some (Turing.PartrecToTM2.unrev q), var := s, stk := S } { l := some q, var := none, stk := Function.update (Function.update S Turing.PartrecToTM2.K'.rev []) Turing.PartrecToTM2.K'.main ((S Turing.PartrecToTM2.K'.rev).reverseAux (S Turing.PartrecToTM2.K'.main)) } - Turing.PartrecToTM2.head_main_ok ๐ Mathlib.Computability.TuringMachine.ToPartrec
{q : Turing.PartrecToTM2.ฮ'} {s : Option Turing.PartrecToTM2.ฮ'} {L : List โ} {c d : List Turing.PartrecToTM2.ฮ'} : StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some (Turing.PartrecToTM2.head Turing.PartrecToTM2.K'.main q), var := s, stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList L) [] c d } { l := some q, var := none, stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList [L.headI]) [] c d } - Turing.PartrecToTM2.succ_ok ๐ Mathlib.Computability.TuringMachine.ToPartrec
{q : Turing.PartrecToTM2.ฮ'} {s : Option Turing.PartrecToTM2.ฮ'} {n : โ} {c d : List Turing.PartrecToTM2.ฮ'} : StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some q.succ, var := s, stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList [n]) [] c d } { l := some q, var := none, stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList [n.succ]) [] c d } - Turing.PartrecToTM2.head_stack_ok ๐ Mathlib.Computability.TuringMachine.ToPartrec
{q : Turing.PartrecToTM2.ฮ'} {s : Option Turing.PartrecToTM2.ฮ'} {Lโ Lโ : List โ} {Lโ : List Turing.PartrecToTM2.ฮ'} : StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some (Turing.PartrecToTM2.head Turing.PartrecToTM2.K'.stack q), var := s, stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList Lโ) [] [] (Turing.PartrecToTM2.trList Lโ ++ Turing.PartrecToTM2.ฮ'.consโ :: Lโ) } { l := some q, var := none, stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList (Lโ.headI :: Lโ)) [] [] Lโ } - Turing.PartrecToTM2.clear_ok ๐ Mathlib.Computability.TuringMachine.ToPartrec
{p : Turing.PartrecToTM2.ฮ' โ Bool} {k : Turing.PartrecToTM2.K'} {q : Turing.PartrecToTM2.ฮ'} {s : Option Turing.PartrecToTM2.ฮ'} {Lโ : List Turing.PartrecToTM2.ฮ'} {o : Option Turing.PartrecToTM2.ฮ'} {Lโ : List Turing.PartrecToTM2.ฮ'} {S : Turing.PartrecToTM2.K' โ List Turing.PartrecToTM2.ฮ'} (e : Turing.PartrecToTM2.splitAtPred p (S k) = (Lโ, o, Lโ)) : StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some (Turing.PartrecToTM2.ฮ'.clear p k q), var := s, stk := S } { l := some q, var := o, stk := Function.update S k Lโ } - Turing.PartrecToTM2.move_ok ๐ Mathlib.Computability.TuringMachine.ToPartrec
{p : Turing.PartrecToTM2.ฮ' โ Bool} {kโ kโ : Turing.PartrecToTM2.K'} {q : Turing.PartrecToTM2.ฮ'} {s : Option Turing.PartrecToTM2.ฮ'} {Lโ : List Turing.PartrecToTM2.ฮ'} {o : Option Turing.PartrecToTM2.ฮ'} {Lโ : List Turing.PartrecToTM2.ฮ'} {S : Turing.PartrecToTM2.K' โ List Turing.PartrecToTM2.ฮ'} (hโ : kโ โ kโ) (e : Turing.PartrecToTM2.splitAtPred p (S kโ) = (Lโ, o, Lโ)) : StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some (Turing.PartrecToTM2.ฮ'.move p kโ kโ q), var := s, stk := S } { l := some q, var := o, stk := Function.update (Function.update S kโ Lโ) kโ (Lโ.reverseAux (S kโ)) } - Turing.PartrecToTM2.pred_ok ๐ Mathlib.Computability.TuringMachine.ToPartrec
(qโ qโ : Turing.PartrecToTM2.ฮ') (s : Option Turing.PartrecToTM2.ฮ') (v : List โ) (c d : List Turing.PartrecToTM2.ฮ') : โ s', StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some (qโ.pred qโ), var := s, stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList v) [] c d } (Nat.rec { l := some qโ, var := s', stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList v.tail) [] c d } (fun n x => { l := some qโ, var := s', stk := Turing.PartrecToTM2.K'.elim (Turing.PartrecToTM2.trList (n :: v.tail)) [] c d }) v.headI) - Turing.PartrecToTM2.tr_succ ๐ Mathlib.Computability.TuringMachine.ToPartrec
(q : Turing.PartrecToTM2.ฮ') : Turing.PartrecToTM2.tr q.succ = Turing.PartrecToTM2.pop' Turing.PartrecToTM2.K'.main (Turing.TM2.Stmt.branch (fun s => decide (s = some Turing.PartrecToTM2.ฮ'.bit1)) (Turing.TM2.Stmt.push Turing.PartrecToTM2.K'.rev (fun x => Turing.PartrecToTM2.ฮ'.bit0) (Turing.TM2.Stmt.goto fun x => q.succ)) (Turing.TM2.Stmt.branch (fun s => decide (s = some Turing.PartrecToTM2.ฮ'.cons)) (Turing.TM2.Stmt.push Turing.PartrecToTM2.K'.main (fun x => Turing.PartrecToTM2.ฮ'.cons) (Turing.TM2.Stmt.push Turing.PartrecToTM2.K'.main (fun x => Turing.PartrecToTM2.ฮ'.bit1) (Turing.TM2.Stmt.goto fun x => Turing.PartrecToTM2.unrev q))) (Turing.TM2.Stmt.push Turing.PartrecToTM2.K'.main (fun x => Turing.PartrecToTM2.ฮ'.bit1) (Turing.TM2.Stmt.goto fun x => Turing.PartrecToTM2.unrev q)))) - Turing.PartrecToTM2.tr_pred ๐ Mathlib.Computability.TuringMachine.ToPartrec
(qโ qโ : Turing.PartrecToTM2.ฮ') : Turing.PartrecToTM2.tr (qโ.pred qโ) = Turing.PartrecToTM2.pop' Turing.PartrecToTM2.K'.main (Turing.TM2.Stmt.branch (fun s => decide (s = some Turing.PartrecToTM2.ฮ'.bit0)) (Turing.TM2.Stmt.push Turing.PartrecToTM2.K'.rev (fun x => Turing.PartrecToTM2.ฮ'.bit1) (Turing.TM2.Stmt.goto fun x => qโ.pred qโ)) (Turing.TM2.Stmt.branch (fun s => Turing.PartrecToTM2.natEnd (s.getD default)) (Turing.TM2.Stmt.goto fun x => qโ) (Turing.PartrecToTM2.peek' Turing.PartrecToTM2.K'.main (Turing.TM2.Stmt.branch (fun s => Turing.PartrecToTM2.natEnd (s.getD default)) (Turing.TM2.Stmt.goto fun x => Turing.PartrecToTM2.unrev qโ) (Turing.TM2.Stmt.push Turing.PartrecToTM2.K'.rev (fun x => Turing.PartrecToTM2.ฮ'.bit0) (Turing.TM2.Stmt.goto fun x => Turing.PartrecToTM2.unrev qโ)))))) - Turing.PartrecToTM2.moveโ_ok ๐ Mathlib.Computability.TuringMachine.ToPartrec
{p : Turing.PartrecToTM2.ฮ' โ Bool} {kโ kโ : Turing.PartrecToTM2.K'} {q : Turing.PartrecToTM2.ฮ'} {s : Option Turing.PartrecToTM2.ฮ'} {Lโ : List Turing.PartrecToTM2.ฮ'} {o : Option Turing.PartrecToTM2.ฮ'} {Lโ : List Turing.PartrecToTM2.ฮ'} {S : Turing.PartrecToTM2.K' โ List Turing.PartrecToTM2.ฮ'} (hโ : kโ โ Turing.PartrecToTM2.K'.rev โง kโ โ Turing.PartrecToTM2.K'.rev โง kโ โ kโ) (hโ : S Turing.PartrecToTM2.K'.rev = []) (e : Turing.PartrecToTM2.splitAtPred p (S kโ) = (Lโ, o, Lโ)) : StateTransition.Reachesโ (Turing.TM2.step Turing.PartrecToTM2.tr) { l := some (Turing.PartrecToTM2.moveโ p kโ kโ q), var := s, stk := S } { l := some q, var := none, stk := Function.update (Function.update S kโ (o.elim id List.cons Lโ)) kโ (Lโ ++ S kโ) }
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
๐Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
๐"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
๐_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
๐Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
๐(?a -> ?b) -> List ?a -> List ?b
๐List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
๐|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allโandโ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
๐|- _ < _ โ tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
โข (_ : Type _)finds all definitions which provide data whileโข (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
๐ Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ โ _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c