AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.Interprets

structureimported Lean

A predicate stating that eval : P.FreeM α → m α is an interpreter for the polynomial effect handler handler : (a : P.A) → m (P.B a). This means that eval is a monad morphism from the free monad P.FreeM to the monad m, and that it extends the interpretation of individual operations given by handler.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
variable {m : Type uB → Type v} {α : Type uB} in
variable [Monad m] (interp : (a : P.A) → m (P.B a)) in
structure PFunctor.FreeM.Interprets (handler : (a : P.A) → m (P.B a)) (eval : P.FreeM α → m α) : Prop
Defined in
CSLib, `PFunctor.FreeM.Interprets`
Lean proof
By Quang Dao, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Quang Dao. 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 11
Used by 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
variable {m : Type uB → Type v} {α : Type uB} in
variable [Monad m] (interp : (a : P.A) → m (P.B a)) in
/-- A predicate stating that `eval : P.FreeM α → m α` is an interpreter for the polynomial effect handler `handler : (a : P.A) → m (P.B a)`. This means that `eval` is a monad morphism from the free monad `P.FreeM` to the monad `m`, and that it extends the interpretation of individual operations given by `handler`. -/
structure PFunctor.FreeM.Interprets (handler : (a : P.A) → m (P.B a)) (eval : P.FreeM α → m α) : Prop where
  apply_pure (a : α) : eval (.pure a) = pure a
  apply_lift_bind (a : P.A) (cont : P.B a → P.FreeM α) :
    eval ((FreeM.lift a).bind cont) = handler a >>= fun x => eval (cont x)
See it in the graphDiscuss this resultChallenge it