AFTD Auto-Formalizing Theoretical Domains

MovingTargetStrategy

inductive

An inductive datatype MovingTargetStrategy parameterized by a type V : Type*, with two constructors: stop : MovingTargetStrategy V representing termination; and query : Finset V → MovingTargetStrategy V → MovingTargetStrategy V → MovingTargetStrategy V, which takes a finite subset of vertices Q : Finset V and two continuation strategies for the negative (false) and positive (true) answers.

Statement

inductive MovingTargetStrategy (V : Type*)
Defined in
arXiv:2611.01281 Definition 2.1
Verified
04 Nov 2026
Axioms
none listed
Used by 5

Read back from the Lean

The definition of an inductive type MovingTargetStrategy parameterized by an arbitrary type V : Type*, representing a binary tree of queries. It has two constructors: 1. stop: a leaf node with no arguments, representing termination. 2. query: an internal node that takes a finite subset of V (Finset V) and two continuation strategies of type MovingTargetStrategy V (the two branches following the query).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A finite adaptive search strategy over a vertex type V. -/
inductive MovingTargetStrategy (V : Type*) | stop : MovingTargetStrategy V
  | query : Finset V → MovingTargetStrategy V → MovingTargetStrategy V → MovingTargetStrategy V
See it in the graphDiscuss this resultChallenge it