AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.FreeWriter.run

defimported Lean

Interprets a FreeWriter computation by recursively traversing the tree, accumulating log entries with the monoid operation, and returns the final value paired with the accumulated log.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.FreeM in
universe u v w w' w'' in
open WriterF in
variable {ω : Type u} {α β : Type*} in
def Cslib.FreeM.FreeWriter.run [Monoid ω] : FreeWriter ω α → α × ω
Defined in
CSLib, `Cslib.FreeM.FreeWriter.run`
Lean proof
By Tanner Duve, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Tanner Duve. 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.
Verified
08 Oct 2026
Axioms
none listed
Built on 29
Used by 8

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.FreeM in
universe u v w w' w'' in
open WriterF in
variable {ω : Type u} {α β : Type*} in
/-- Interprets a `FreeWriter` computation by recursively traversing the tree, accumulating log entries with the monoid operation, and returns the final value paired with the accumulated log. -/
def Cslib.FreeM.FreeWriter.run [Monoid ω] : FreeWriter ω α → α × ω
  | .pure a => (a, 1)
  | .liftBind (.tell w) k =>
      let (a, w') := run (k .unit)
      (a, w * w')
See it in the graphDiscuss this resultChallenge it