AFTD Auto-Formalizing Theoretical Domains

Cslib.Turing.StackTape.length

defimported Lean

The length of the StackTape is the number of elements up to the last non-none element

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.Turing in
attribute [local grind! .] StackTape.toList_getLast?_ne_some_none in
variable {Symbol : Type*} in
@[grind]
def Cslib.Turing.StackTape.length (l : StackTape Symbol) : ℕ
Defined in
CSLib, `Cslib.Turing.StackTape.length`
Lean proof
By Bolton Bailey, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Bolton Bailey. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
What was changed in Cslib.Turing.StackTape.length
--- Cslib/Foundations/Data/StackTape.lean:148 (Cslib.Turing.StackTape.length)
+++ as compiled here
@@ -1,3 +1,7 @@
-/-- The length of the `StackTape` is the number of elements up to the last non-`none` element -/
-@[scoped grind]
-def length (l : StackTape Symbol) : ℕ := l.toList.length
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Cslib Cslib.Turing in
+attribute [local grind! .] StackTape.toList_getLast?_ne_some_none in
+variable {Symbol : Type*} in
+@[grind]
+def Cslib.Turing.StackTape.length (l : StackTape Symbol) : ℕ := l.toList.length
Verified
08 Oct 2026
Axioms
none listed
Built on 10
Used by 8

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.Turing in
attribute [local grind! .] StackTape.toList_getLast?_ne_some_none in
variable {Symbol : Type*} in
/-- The length of the `StackTape` is the number of elements up to the last non-`none` element -/
@[grind]
def Cslib.Turing.StackTape.length (l : StackTape Symbol) : ℕ := l.toList.length
See it in the graphDiscuss this resultChallenge it