Theorems · Definition · logic and foundations

Turing.ListBlank.flatMap

{Γ : Type u_1} →
  {Γ' : Type u_2} →
    [inst : Inhabited Γ] →
      [inst_1 : Inhabited Γ'] →
        Turing.ListBlank Γ → (f : Γ → List Γ') → (∃ n, f default = List.replicate n default) → Turing.ListBlank Γ'

The flatMap function on lists is well defined on ListBlanks provided that the default element is sent to a sequence of default elements.

Defined in

Mathlib.Computability.TuringMachine.Tape

Cited by

6 results in Mathlib

Foundations

Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

InhabitedInhabited