Glossary¶
Words this course uses, in the sense it uses them.
- Axiom
- A statement Lean accepts without proof. Lean's standard three are
trusted by everyone; this project's
make proofsrefuses any other, which is how it catchessorryandnative_decide. - Constructor
- One of the ways to make a value of an
inductivetype, such asAction.flip. A structure has one constructor, written⟨…⟩. - Event
- A record of something that happened in a game, for players to read. Each accepted move produces a list of them.
- Goal
- What is still to be proved, at some point in a proof. The infoview shows it.
- Guarantee
- In this project, a theorem in a game's
Proofs/<Game>/Guarantees.lean: a property of the rules, stated in plain words and proven.docs/GUARANTEES.mdlists them all. - Hypothesis
- An assumption a theorem makes, named in brackets before its colon, such
as
(finished : s.phase = .finished w). - Implicit argument
- An argument in curly braces, such as
{s : State}, that Lean works out from the other arguments, so you don't write it. - Indistinguishability
- The way this project states secrecy: two games that differ only in hidden things give a player exactly the same view.
- Induction
- Proving something for every list (or number) by proving it for the empty
list, and for
a :: lassuming it forl. - Instance
- A type's answer to a type class: for example, each game's
instance : Game State, which tells the engine how that game works. - Invariant
- A property true in every reachable state: true at the start, and kept by every accepted move.
- Kernel
- The small core of Lean that checks every proof. Everything else, tactics included, only proposes proofs for it to check.
- Key
- The secret a seat's player holds. The engine opens a seat's view, and accepts its moves, only with that seat's key, and proves it.
- Permutation
- The same elements, in any order:
List.Perm. How the project says "the same cards". Prop- The type of statements. A value of a statement's type is a proof of it.
- Session
- One table: a game's state, its history of events, its players' names and the seats' keys.
sorry- Lean's placeholder for a missing proof. Lean accepts it with a warning,
so this project's
make proofsrefuses any. - Specification
- A plain statement of what a rule is, such as Lol's
Legal, kept beside the code that runs it (check), with a proof that the two agree. - State
- Everything about a game at one moment. A move is a function from the state before to the state after.
- Tactic
- One step of a proof written after
by, which changes the goal. - Type class
- A list of questions a type can answer, such as the engine's
Game. Code written for any type that answers them works for every game. - View
- What the engine sends one player: what they may see of the game, the moves they may make, the events they may read, all in the engine's words.