AFTD Auto-Formalizing Theoretical Domains

Cslib.FLP.Action

abbrevimported Lean

The type of labels of the LTS defined by an Algorithm, where some m denotes the reception of message m and none denotes a stuttering step.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Sum Multiset in
variable {P M S : Type*} [DecidableEq P] [DecidableEq M] in
abbrev Cslib.FLP.Action (P M : Type*)
Defined in
CSLib, `Cslib.FLP.Action`
Lean proof
By Ching-Tsun Chou, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Ching-Tsun Chou. 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 1
Used by 1
  • Cslib.FLP.DestInDestIn ps x means that if x ≠ none, then x = some m with m.dest ∈ ps.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Sum Multiset in
variable {P M S : Type*} [DecidableEq P] [DecidableEq M] in
/-- The type of labels of the LTS defined by an `Algorithm`, where `some m` denotes the reception of message `m` and `none` denotes a stuttering step. -/
abbrev Cslib.FLP.Action (P M : Type*) := Option (Message P M)
See it in the graphDiscuss this resultChallenge it