AFTD Auto-Formalizing Theoretical Domains

Cslib.FLP.Message

structureimported Lean

The type of messages that processes send to each other.

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
@[ext]
structure Cslib.FLP.Message (P M : Type*)
Defined in
CSLib, `Cslib.FLP.Message`
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
Used by 5
  • Cslib.FLP.StateThe global state of the distributed algorithm.
  • Cslib.FLP.DestInDestIn ps x means that if x ≠ none, then x = some m with m.dest ∈ ps.
  • Cslib.FLP.AlgorithmThe specification of a distributed algorithm for solving the consensus problem. Note that each field below can depend on a process's…
  • Cslib.FLP.ActionThe type of labels of the LTS defined by an Algorithm, where some m denotes the reception of message m and none denotes a…
  • Cslib.FLP.ZeroFaultAlg.algalg is the asynchronous distributed consensus algorithm described above.

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 messages that processes send to each other. -/
@[ext]
structure Cslib.FLP.Message (P M : Type*) where
  /-- The destination of a message. -/
  dest : P
  /-- The content of the message, where the `Bool` option is used to carry to the
      initial boolean value to each process. -/
  msg : Bool ⊕ M
deriving DecidableEq
See it in the graphDiscuss this resultChallenge it