oxilean_kernel/proof/

types.rs

//! Auto-generated module
//!
//! 🤖 Generated with [SplitRS](https://github.com/cool-japan/splitrs)

use crate::Node;
use crate::{Expr, LevelView, Name};
use std::collections::{HashMap, HashSet};
use std::rc::Rc;

use super::functions::*;

/// Proof term utilities.
pub struct ProofTerm;
impl ProofTerm {
    /// Check if an expression is a proof of a proposition.
    ///
    /// In CiC, propositions are types in Prop. A proof is a term
    /// inhabiting such a type. Without a type checker available,
    /// we use structural heuristics.
    pub fn is_proof(term: &Expr, prop: &Expr) -> bool {
        if Self::could_be_prop(prop) {
            Self::is_well_formed(term)
        } else {
            false
        }
    }
    /// Check if a type expression could be a proposition (in Sort 0).
    ///
    /// A type is a Prop if its universe is Sort 0.
    pub fn could_be_prop(ty: &Expr) -> bool {
        match ty {
            Expr::Sort(l) if matches!(l.view(), LevelView::Zero) => true,
            Expr::Pi(_, _, _, body) => Self::could_be_prop(body),
            Expr::Const(_, _) => true,
            Expr::App(_, _) => true,
            _ => false,
        }
    }
    /// Check if a type is definitely Prop (Sort 0).
    pub fn is_sort_zero(ty: &Expr) -> bool {
        matches!(ty, Expr::Sort(l) if matches!(l.view(), LevelView::Zero))
    }
    /// Extract the proposition from a proof term's type annotation.
    ///
    /// If the term is `(t : P)` where P is a Prop, returns P.
    pub fn get_proposition(term: &Expr) -> Option<Expr> {
        match term {
            Expr::Lam(_, _, ty, _) if Self::could_be_prop(ty) => Some((**ty).clone()),
            _ => None,
        }
    }
    /// Check if a proof uses only constructive axioms.
    ///
    /// A proof is constructive if it doesn't depend on:
    /// - Classical.choice
    /// - Classical.em (excluded middle)
    /// - propext (propositional extensionality, though debatable)
    pub fn is_constructive(term: &Expr) -> bool {
        let deps = collect_axiom_deps(term);
        !deps
            .iter()
            .any(|name: &Name| CLASSICAL_AXIOMS.contains(&name.to_string().as_str()))
    }
    /// Collect all constant names used in a term.
    pub fn collect_constants(term: &Expr) -> HashSet<Name> {
        let mut result = HashSet::new();
        collect_constants_impl(term, &mut result);
        result
    }
    /// Count the size (number of nodes) of a proof term.
    pub fn size(term: &Expr) -> usize {
        match term {
            Expr::BVar(_) | Expr::FVar(_) | Expr::Const(_, _) | Expr::Sort(_) | Expr::Lit(_) => 1,
            Expr::App(f, a) => 1 + Self::size(f) + Self::size(a),
            Expr::Lam(_, _, ty, body) => 1 + Self::size(ty) + Self::size(body),
            Expr::Pi(_, _, ty, body) => 1 + Self::size(ty) + Self::size(body),
            Expr::Let(_, ty, val, body) => 1 + Self::size(ty) + Self::size(val) + Self::size(body),
            Expr::Proj(_, _, e) => 1 + Self::size(e),
        }
    }
    /// Compute the depth of a proof term.
    pub fn depth(term: &Expr) -> usize {
        match term {
            Expr::BVar(_) | Expr::FVar(_) | Expr::Const(_, _) | Expr::Sort(_) | Expr::Lit(_) => 0,
            Expr::App(f, a) => 1 + Self::depth(f).max(Self::depth(a)),
            Expr::Lam(_, _, ty, body) => 1 + Self::depth(ty).max(Self::depth(body)),
            Expr::Pi(_, _, ty, body) => 1 + Self::depth(ty).max(Self::depth(body)),
            Expr::Let(_, ty, val, body) => {
                1 + Self::depth(ty).max(Self::depth(val)).max(Self::depth(body))
            }
            Expr::Proj(_, _, e) => 1 + Self::depth(e),
        }
    }
    /// Check if a term is well-formed (basic structural check).
    fn is_well_formed(term: &Expr) -> bool {
        match term {
            Expr::BVar(_) | Expr::FVar(_) | Expr::Const(_, _) | Expr::Sort(_) | Expr::Lit(_) => {
                true
            }
            Expr::App(f, a) => Self::is_well_formed(f) && Self::is_well_formed(a),
            Expr::Lam(_, _, ty, body) => Self::is_well_formed(ty) && Self::is_well_formed(body),
            Expr::Pi(_, _, ty, body) => Self::is_well_formed(ty) && Self::is_well_formed(body),
            Expr::Let(_, ty, val, body) => {
                Self::is_well_formed(ty) && Self::is_well_formed(val) && Self::is_well_formed(body)
            }
            Expr::Proj(_, _, e) => Self::is_well_formed(e),
        }
    }
    /// Check if two proofs are of the same proposition structure.
    ///
    /// When proof irrelevance is enabled, this can be used to determine
    /// if two proofs should be considered equal.
    pub fn same_proposition_structure(p1: &Expr, p2: &Expr) -> bool {
        match (p1, p2) {
            (Expr::Sort(l1), Expr::Sort(l2)) => l1 == l2,
            (Expr::Const(n1, _), Expr::Const(n2, _)) => n1 == n2,
            (Expr::App(f1, a1), Expr::App(f2, a2)) => {
                Self::same_proposition_structure(f1, f2) && Self::same_proposition_structure(a1, a2)
            }
            (Expr::Pi(_, _, ty1, body1), Expr::Pi(_, _, ty2, body2)) => {
                Self::same_proposition_structure(ty1, ty2)
                    && Self::same_proposition_structure(body1, body2)
            }
            _ => p1 == p2,
        }
    }
}
/// A flat list of substitution pairs `(from, to)`.
#[allow(dead_code)]
pub struct FlatSubstitution {
    pairs: Vec<(String, String)>,
}
#[allow(dead_code)]
impl FlatSubstitution {
    /// Creates an empty substitution.
    pub fn new() -> Self {
        Self { pairs: Vec::new() }
    }
    /// Adds a pair.
    pub fn add(&mut self, from: impl Into<String>, to: impl Into<String>) {
        self.pairs.push((from.into(), to.into()));
    }
    /// Applies all substitutions to `s` (leftmost-first order).
    pub fn apply(&self, s: &str) -> String {
        let mut result = s.to_string();
        for (from, to) in &self.pairs {
            result = result.replace(from.as_str(), to.as_str());
        }
        result
    }
    /// Returns the number of pairs.
    pub fn len(&self) -> usize {
        self.pairs.len()
    }
    /// Returns `true` if empty.
    pub fn is_empty(&self) -> bool {
        self.pairs.is_empty()
    }
}
/// A label set for a graph node.
#[allow(dead_code)]
pub struct LabelSet {
    labels: Vec<String>,
}
#[allow(dead_code)]
impl LabelSet {
    /// Creates a new empty label set.
    pub fn new() -> Self {
        Self { labels: Vec::new() }
    }
    /// Adds a label (deduplicates).
    pub fn add(&mut self, label: impl Into<String>) {
        let s = label.into();
        if !self.labels.contains(&s) {
            self.labels.push(s);
        }
    }
    /// Returns `true` if `label` is present.
    pub fn has(&self, label: &str) -> bool {
        self.labels.iter().any(|l| l == label)
    }
    /// Returns the count of labels.
    pub fn count(&self) -> usize {
        self.labels.len()
    }
    /// Returns all labels.
    pub fn all(&self) -> &[String] {
        &self.labels
    }
}
/// A fixed-size sliding window that computes a running sum.
#[allow(dead_code)]
pub struct SlidingSum {
    window: Vec<f64>,
    capacity: usize,
    pos: usize,
    sum: f64,
    count: usize,
}
#[allow(dead_code)]
impl SlidingSum {
    /// Creates a sliding sum with the given window size.
    pub fn new(capacity: usize) -> Self {
        Self {
            window: vec![0.0; capacity],
            capacity,
            pos: 0,
            sum: 0.0,
            count: 0,
        }
    }
    /// Adds a value to the window, removing the oldest if full.
    pub fn push(&mut self, val: f64) {
        let oldest = self.window[self.pos];
        self.sum -= oldest;
        self.sum += val;
        self.window[self.pos] = val;
        self.pos = (self.pos + 1) % self.capacity;
        if self.count < self.capacity {
            self.count += 1;
        }
    }
    /// Returns the current window sum.
    pub fn sum(&self) -> f64 {
        self.sum
    }
    /// Returns the window mean, or `None` if empty.
    pub fn mean(&self) -> Option<f64> {
        if self.count == 0 {
            None
        } else {
            Some(self.sum / self.count as f64)
        }
    }
    /// Returns the current window size (number of valid elements).
    pub fn count(&self) -> usize {
        self.count
    }
}
/// A trie-based prefix counter.
#[allow(dead_code)]
pub struct PrefixCounter {
    children: std::collections::HashMap<char, PrefixCounter>,
    count: usize,
}
#[allow(dead_code)]
impl PrefixCounter {
    /// Creates an empty prefix counter.
    pub fn new() -> Self {
        Self {
            children: std::collections::HashMap::new(),
            count: 0,
        }
    }
    /// Records a string.
    pub fn record(&mut self, s: &str) {
        self.count += 1;
        let mut node = self;
        for c in s.chars() {
            node = node.children.entry(c).or_default();
            node.count += 1;
        }
    }
    /// Returns how many strings have been recorded that start with `prefix`.
    pub fn count_with_prefix(&self, prefix: &str) -> usize {
        let mut node = self;
        for c in prefix.chars() {
            match node.children.get(&c) {
                Some(n) => node = n,
                None => return 0,
            }
        }
        node.count
    }
}
/// A simple key-value store backed by a sorted Vec for small maps.
#[allow(dead_code)]
pub struct SmallMap<K: Ord + Clone, V: Clone> {
    entries: Vec<(K, V)>,
}
#[allow(dead_code)]
impl<K: Ord + Clone, V: Clone> SmallMap<K, V> {
    /// Creates a new empty small map.
    pub fn new() -> Self {
        Self {
            entries: Vec::new(),
        }
    }
    /// Inserts or replaces the value for `key`.
    pub fn insert(&mut self, key: K, val: V) {
        match self.entries.binary_search_by_key(&&key, |(k, _)| k) {
            Ok(i) => self.entries[i].1 = val,
            Err(i) => self.entries.insert(i, (key, val)),
        }
    }
    /// Returns the value for `key`, or `None`.
    pub fn get(&self, key: &K) -> Option<&V> {
        self.entries
            .binary_search_by_key(&key, |(k, _)| k)
            .ok()
            .map(|i| &self.entries[i].1)
    }
    /// Returns the number of entries.
    pub fn len(&self) -> usize {
        self.entries.len()
    }
    /// Returns `true` if empty.
    pub fn is_empty(&self) -> bool {
        self.entries.is_empty()
    }
    /// Returns all keys.
    pub fn keys(&self) -> Vec<&K> {
        self.entries.iter().map(|(k, _)| k).collect()
    }
    /// Returns all values.
    pub fn values(&self) -> Vec<&V> {
        self.entries.iter().map(|(_, v)| v).collect()
    }
}
/// A window iterator that yields overlapping windows of size `n`.
#[allow(dead_code)]
pub struct WindowIterator<'a, T> {
    pub(super) data: &'a [T],
    pub(super) pos: usize,
    pub(super) window: usize,
}
#[allow(dead_code)]
impl<'a, T> WindowIterator<'a, T> {
    /// Creates a new window iterator.
    pub fn new(data: &'a [T], window: usize) -> Self {
        Self {
            data,
            pos: 0,
            window,
        }
    }
}
/// A generic counter that tracks min/max/sum for statistical summaries.
#[allow(dead_code)]
pub struct StatSummary {
    count: u64,
    sum: f64,
    min: f64,
    max: f64,
}
#[allow(dead_code)]
impl StatSummary {
    /// Creates an empty summary.
    pub fn new() -> Self {
        Self {
            count: 0,
            sum: 0.0,
            min: f64::INFINITY,
            max: f64::NEG_INFINITY,
        }
    }
    /// Records a sample.
    pub fn record(&mut self, val: f64) {
        self.count += 1;
        self.sum += val;
        if val < self.min {
            self.min = val;
        }
        if val > self.max {
            self.max = val;
        }
    }
    /// Returns the mean, or `None` if no samples.
    pub fn mean(&self) -> Option<f64> {
        if self.count == 0 {
            None
        } else {
            Some(self.sum / self.count as f64)
        }
    }
    /// Returns the minimum, or `None` if no samples.
    pub fn min(&self) -> Option<f64> {
        if self.count == 0 {
            None
        } else {
            Some(self.min)
        }
    }
    /// Returns the maximum, or `None` if no samples.
    pub fn max(&self) -> Option<f64> {
        if self.count == 0 {
            None
        } else {
            Some(self.max)
        }
    }
    /// Returns the count of recorded samples.
    pub fn count(&self) -> u64 {
        self.count
    }
}
/// A collection of proof obligations, tracking overall proof state.
#[allow(dead_code)]
#[derive(Debug, Clone, Default)]
pub struct ProofState {
    /// All obligations in this proof attempt.
    pub obligations: Vec<ProofObligation>,
}
impl ProofState {
    /// Create a fresh proof state with no obligations.
    #[allow(dead_code)]
    pub fn new() -> Self {
        Self::default()
    }
    /// Add a new proof obligation.
    #[allow(dead_code)]
    pub fn add_obligation(&mut self, label: impl Into<String>, proposition: Expr) {
        self.obligations
            .push(ProofObligation::new(label, proposition));
    }
    /// Number of obligations that remain undischarged.
    #[allow(dead_code)]
    pub fn remaining(&self) -> usize {
        self.obligations
            .iter()
            .filter(|o| !o.is_discharged())
            .count()
    }
    /// Whether all obligations are discharged.
    #[allow(dead_code)]
    pub fn is_complete(&self) -> bool {
        self.remaining() == 0
    }
    /// Discharge the first undischarged obligation with the given proof.
    ///
    /// Returns `true` if an obligation was discharged, `false` if all were already done.
    #[allow(dead_code)]
    pub fn discharge_next(&mut self, proof: Expr) -> bool {
        for obl in self.obligations.iter_mut() {
            if !obl.discharged {
                obl.discharge(proof);
                return true;
            }
        }
        false
    }
    /// Returns references to all undischarged obligations.
    #[allow(dead_code)]
    pub fn open_obligations(&self) -> Vec<&ProofObligation> {
        self.obligations
            .iter()
            .filter(|o| !o.is_discharged())
            .collect()
    }
}
/// A simple directed acyclic graph.
#[allow(dead_code)]
pub struct SimpleDag {
    /// `edges[i]` is the list of direct successors of node `i`.
    edges: Vec<Vec<usize>>,
}
#[allow(dead_code)]
impl SimpleDag {
    /// Creates a DAG with `n` nodes and no edges.
    pub fn new(n: usize) -> Self {
        Self {
            edges: vec![Vec::new(); n],
        }
    }
    /// Adds an edge from `from` to `to`.
    pub fn add_edge(&mut self, from: usize, to: usize) {
        if from < self.edges.len() {
            self.edges[from].push(to);
        }
    }
    /// Returns the successors of `node`.
    pub fn successors(&self, node: usize) -> &[usize] {
        self.edges.get(node).map(|v| v.as_slice()).unwrap_or(&[])
    }
    /// Returns `true` if `from` can reach `to` via DFS.
    pub fn can_reach(&self, from: usize, to: usize) -> bool {
        let mut visited = vec![false; self.edges.len()];
        self.dfs(from, to, &mut visited)
    }
    fn dfs(&self, cur: usize, target: usize, visited: &mut Vec<bool>) -> bool {
        if cur == target {
            return true;
        }
        if cur >= visited.len() || visited[cur] {
            return false;
        }
        visited[cur] = true;
        for &next in self.successors(cur) {
            if self.dfs(next, target, visited) {
                return true;
            }
        }
        false
    }
    /// Returns the topological order of nodes, or `None` if a cycle is detected.
    pub fn topological_sort(&self) -> Option<Vec<usize>> {
        let n = self.edges.len();
        let mut in_degree = vec![0usize; n];
        for succs in &self.edges {
            for &s in succs {
                if s < n {
                    in_degree[s] += 1;
                }
            }
        }
        let mut queue: std::collections::VecDeque<usize> =
            (0..n).filter(|&i| in_degree[i] == 0).collect();
        let mut order = Vec::new();
        while let Some(node) = queue.pop_front() {
            order.push(node);
            for &s in self.successors(node) {
                if s < n {
                    in_degree[s] -= 1;
                    if in_degree[s] == 0 {
                        queue.push_back(s);
                    }
                }
            }
        }
        if order.len() == n {
            Some(order)
        } else {
            None
        }
    }
    /// Returns the number of nodes.
    pub fn num_nodes(&self) -> usize {
        self.edges.len()
    }
}
/// A dependency closure builder (transitive closure via BFS).
#[allow(dead_code)]
pub struct TransitiveClosure {
    adj: Vec<Vec<usize>>,
    n: usize,
}
#[allow(dead_code)]
impl TransitiveClosure {
    /// Creates a transitive closure builder for `n` nodes.
    pub fn new(n: usize) -> Self {
        Self {
            adj: vec![Vec::new(); n],
            n,
        }
    }
    /// Adds a direct edge.
    pub fn add_edge(&mut self, from: usize, to: usize) {
        if from < self.n {
            self.adj[from].push(to);
        }
    }
    /// Computes all nodes reachable from `start` (including `start`).
    pub fn reachable_from(&self, start: usize) -> Vec<usize> {
        let mut visited = vec![false; self.n];
        let mut queue = std::collections::VecDeque::new();
        queue.push_back(start);
        while let Some(node) = queue.pop_front() {
            if node >= self.n || visited[node] {
                continue;
            }
            visited[node] = true;
            for &next in &self.adj[node] {
                queue.push_back(next);
            }
        }
        (0..self.n).filter(|&i| visited[i]).collect()
    }
    /// Returns `true` if `from` can transitively reach `to`.
    pub fn can_reach(&self, from: usize, to: usize) -> bool {
        self.reachable_from(from).contains(&to)
    }
}
/// A reusable scratch buffer for path computations.
#[allow(dead_code)]
pub struct PathBuf {
    components: Vec<String>,
}
#[allow(dead_code)]
impl PathBuf {
    /// Creates a new empty path buffer.
    pub fn new() -> Self {
        Self {
            components: Vec::new(),
        }
    }
    /// Pushes a component.
    pub fn push(&mut self, comp: impl Into<String>) {
        self.components.push(comp.into());
    }
    /// Pops the last component.
    pub fn pop(&mut self) {
        self.components.pop();
    }
    /// Returns the current path as a `/`-separated string.
    pub fn as_str(&self) -> String {
        self.components.join("/")
    }
    /// Returns the depth of the path.
    pub fn depth(&self) -> usize {
        self.components.len()
    }
    /// Clears the path.
    pub fn clear(&mut self) {
        self.components.clear();
    }
}
/// A set of rewrite rules.
#[allow(dead_code)]
pub struct RewriteRuleSet {
    rules: Vec<RewriteRule>,
}
#[allow(dead_code)]
impl RewriteRuleSet {
    /// Creates an empty rule set.
    pub fn new() -> Self {
        Self { rules: Vec::new() }
    }
    /// Adds a rule.
    pub fn add(&mut self, rule: RewriteRule) {
        self.rules.push(rule);
    }
    /// Returns the number of rules.
    pub fn len(&self) -> usize {
        self.rules.len()
    }
    /// Returns `true` if the set is empty.
    pub fn is_empty(&self) -> bool {
        self.rules.is_empty()
    }
    /// Returns all conditional rules.
    pub fn conditional_rules(&self) -> Vec<&RewriteRule> {
        self.rules.iter().filter(|r| r.conditional).collect()
    }
    /// Returns all unconditional rules.
    pub fn unconditional_rules(&self) -> Vec<&RewriteRule> {
        self.rules.iter().filter(|r| !r.conditional).collect()
    }
    /// Looks up a rule by name.
    pub fn get(&self, name: &str) -> Option<&RewriteRule> {
        self.rules.iter().find(|r| r.name == name)
    }
}
/// Describes the complexity class of a proof term.
#[allow(dead_code)]
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum ProofComplexity {
    /// A single atomic term (constant, BVar, FVar, literal, sort).
    Atomic,
    /// A lambda abstraction wrapping a simpler proof.
    Abstraction,
    /// An application (function applied to argument).
    Application,
    /// A `let`-binding with a subproof body.
    LetBinding,
    /// A projection out of a structure.
    Projection,
    /// Any composite term beyond the above categories.
    Composite,
}
/// A proof analysis engine.
pub struct ProofAnalyzer;
impl ProofAnalyzer {
    /// Check whether a proof is constructive (no classical axioms).
    pub fn is_constructive(term: &Expr) -> bool {
        !Self::uses_classical(term)
    }
    /// Check whether a proof uses any classical axioms.
    pub fn uses_classical(term: &Expr) -> bool {
        match term {
            Expr::Const(n, _) => {
                let s = n.to_string();
                s == "Classical.choice" || s == "Classical.em" || s == "propext"
            }
            Expr::App(f, a) => Self::uses_classical(f) || Self::uses_classical(a),
            Expr::Lam(_, _, ty, body) | Expr::Pi(_, _, ty, body) => {
                Self::uses_classical(ty) || Self::uses_classical(body)
            }
            Expr::Let(_, ty, val, body) => {
                Self::uses_classical(ty) || Self::uses_classical(val) || Self::uses_classical(body)
            }
            _ => false,
        }
    }
    /// Count the number of applications in a proof term.
    pub fn count_applications(term: &Expr) -> usize {
        match term {
            Expr::App(f, a) => 1 + Self::count_applications(f) + Self::count_applications(a),
            Expr::Lam(_, _, ty, body) | Expr::Pi(_, _, ty, body) => {
                Self::count_applications(ty) + Self::count_applications(body)
            }
            Expr::Let(_, ty, val, body) => {
                Self::count_applications(ty)
                    + Self::count_applications(val)
                    + Self::count_applications(body)
            }
            _ => 0,
        }
    }
}
/// A minimal proof normalizer that applies beta reduction to proof terms.
///
/// In the kernel, proof terms are normalised before definitional equality
/// checks to avoid spurious inequality due to un-reduced redexes.
#[allow(dead_code)]
pub struct ProofNormalizer;
impl ProofNormalizer {
    /// Beta-reduce a proof term to its normal form.
    ///
    /// This is a simple structural pass that eliminates `(fun x => body) arg`
    /// redexes by substituting `arg` for bound variable `0` in `body`.
    #[allow(dead_code)]
    pub fn beta_reduce(term: &Expr) -> Expr {
        match term {
            Expr::App(f, arg) => {
                let f_reduced = Self::beta_reduce(f);
                let arg_reduced = Self::beta_reduce(arg);
                if let Expr::Lam(_, _, _, body) = f_reduced {
                    let substituted = Self::subst_bvar((*body).clone(), 0, &arg_reduced);
                    Self::beta_reduce(&substituted)
                } else {
                    Expr::App(Node::new(f_reduced), Node::new(arg_reduced))
                }
            }
            Expr::Lam(bk, n, ty, body) => {
                let ty_red = Self::beta_reduce(ty);
                let body_red = Self::beta_reduce(body);
                Expr::Lam(*bk, n.clone(), Node::new(ty_red), Node::new(body_red))
            }
            Expr::Pi(bk, n, ty, body) => {
                let ty_red = Self::beta_reduce(ty);
                let body_red = Self::beta_reduce(body);
                Expr::Pi(*bk, n.clone(), Node::new(ty_red), Node::new(body_red))
            }
            Expr::Let(_n, _ty, val, body) => {
                let val_red = Self::beta_reduce(val);
                let body_subst = Self::subst_bvar((**body).clone(), 0, &val_red);
                Self::beta_reduce(&body_subst)
            }
            Expr::Proj(idx, n, e) => Expr::Proj(idx.clone(), *n, Node::new(Self::beta_reduce(e))),
            other => other.clone(),
        }
    }
    /// Substitute `replacement` for bound variable `depth` in `term`.
    ///
    /// This implements the standard capture-avoiding substitution for de Bruijn terms.
    #[allow(dead_code)]
    pub fn subst_bvar(term: Expr, depth: u32, replacement: &Expr) -> Expr {
        match term {
            Expr::BVar(i) => {
                if i == depth {
                    replacement.clone()
                } else if i > depth {
                    Expr::BVar(i - 1)
                } else {
                    Expr::BVar(i)
                }
            }
            Expr::App(f, a) => Expr::App(
                Node::new(Self::subst_bvar((*f).clone(), depth, replacement)),
                Node::new(Self::subst_bvar((*a).clone(), depth, replacement)),
            ),
            Expr::Lam(bk, n, ty, body) => Expr::Lam(
                bk,
                n,
                Node::new(Self::subst_bvar((*ty).clone(), depth, replacement)),
                Node::new(Self::subst_bvar((*body).clone(), depth + 1, replacement)),
            ),
            Expr::Pi(bk, n, ty, body) => Expr::Pi(
                bk,
                n,
                Node::new(Self::subst_bvar((*ty).clone(), depth, replacement)),
                Node::new(Self::subst_bvar((*body).clone(), depth + 1, replacement)),
            ),
            Expr::Let(n, ty, val, body) => Expr::Let(
                n,
                Node::new(Self::subst_bvar((*ty).clone(), depth, replacement)),
                Node::new(Self::subst_bvar((*val).clone(), depth, replacement)),
                Node::new(Self::subst_bvar((*body).clone(), depth + 1, replacement)),
            ),
            Expr::Proj(idx, n, e) => Expr::Proj(
                idx,
                n,
                Node::new(Self::subst_bvar((*e).clone(), depth, replacement)),
            ),
            other => other,
        }
    }
    /// Count the number of beta-redexes remaining in a term.
    #[allow(dead_code)]
    pub fn count_redexes(term: &Expr) -> usize {
        match term {
            Expr::App(f, a) => {
                let in_f = Self::count_redexes(f);
                let in_a = Self::count_redexes(a);
                let is_redex = matches!(f.as_ref(), Expr::Lam(_, _, _, _));
                in_f + in_a + if is_redex { 1 } else { 0 }
            }
            Expr::Lam(_, _, ty, body) => Self::count_redexes(ty) + Self::count_redexes(body),
            Expr::Pi(_, _, ty, body) => Self::count_redexes(ty) + Self::count_redexes(body),
            Expr::Let(_, ty, val, body) => {
                Self::count_redexes(ty) + Self::count_redexes(val) + Self::count_redexes(body)
            }
            Expr::Proj(_, _, e) => Self::count_redexes(e),
            _ => 0,
        }
    }
    /// Returns `true` if the term is already in beta-normal form (no redexes).
    #[allow(dead_code)]
    pub fn is_beta_normal(term: &Expr) -> bool {
        Self::count_redexes(term) == 0
    }
}
/// A proof skeleton: a proof term with holes (`sorry`) that need to be filled.
///
/// Proof skeletons are used in structured proof construction to track
/// what remains to be proved.
#[allow(dead_code)]
#[derive(Clone, Debug)]
pub struct ProofSkeleton {
    /// The proof term, which may contain `sorry` nodes.
    pub term: Expr,
    /// The type (proposition) being proved.
    pub ty: Expr,
    /// Names of the holes that still need proofs.
    pub holes: Vec<Name>,
}
impl ProofSkeleton {
    /// Create a new proof skeleton.
    #[allow(dead_code)]
    pub fn new(term: Expr, ty: Expr) -> Self {
        let holes = Self::collect_holes(&term);
        Self { term, ty, holes }
    }
    /// Collect all `sorry` positions from a term.
    fn collect_holes(term: &Expr) -> Vec<Name> {
        let mut holes = Vec::new();
        Self::collect_holes_rec(term, &mut holes);
        holes
    }
    fn collect_holes_rec(term: &Expr, holes: &mut Vec<Name>) {
        match term {
            Expr::Const(n, _) if n.to_string().contains("sorry") => {
                holes.push(n.clone());
            }
            Expr::App(f, a) => {
                Self::collect_holes_rec(f, holes);
                Self::collect_holes_rec(a, holes);
            }
            Expr::Lam(_, _, ty, body) | Expr::Pi(_, _, ty, body) => {
                Self::collect_holes_rec(ty, holes);
                Self::collect_holes_rec(body, holes);
            }
            Expr::Let(_, ty, val, body) => {
                Self::collect_holes_rec(ty, holes);
                Self::collect_holes_rec(val, holes);
                Self::collect_holes_rec(body, holes);
            }
            _ => {}
        }
    }
    /// Whether the skeleton has no remaining holes.
    #[allow(dead_code)]
    pub fn is_complete(&self) -> bool {
        self.holes.is_empty()
    }
    /// Number of remaining holes.
    #[allow(dead_code)]
    pub fn num_holes(&self) -> usize {
        self.holes.len()
    }
}
/// A pair of `StatSummary` values tracking before/after a transformation.
#[allow(dead_code)]
pub struct TransformStat {
    before: StatSummary,
    after: StatSummary,
}
#[allow(dead_code)]
impl TransformStat {
    /// Creates a new transform stat recorder.
    pub fn new() -> Self {
        Self {
            before: StatSummary::new(),
            after: StatSummary::new(),
        }
    }
    /// Records a before value.
    pub fn record_before(&mut self, v: f64) {
        self.before.record(v);
    }
    /// Records an after value.
    pub fn record_after(&mut self, v: f64) {
        self.after.record(v);
    }
    /// Returns the mean reduction ratio (after/before).
    pub fn mean_ratio(&self) -> Option<f64> {
        let b = self.before.mean()?;
        let a = self.after.mean()?;
        if b.abs() < f64::EPSILON {
            return None;
        }
        Some(a / b)
    }
}
/// A non-empty list (at least one element guaranteed).
#[allow(dead_code)]
pub struct NonEmptyVec<T> {
    head: T,
    tail: Vec<T>,
}
#[allow(dead_code)]
impl<T> NonEmptyVec<T> {
    /// Creates a non-empty vec with a single element.
    pub fn singleton(val: T) -> Self {
        Self {
            head: val,
            tail: Vec::new(),
        }
    }
    /// Pushes an element.
    pub fn push(&mut self, val: T) {
        self.tail.push(val);
    }
    /// Returns a reference to the first element.
    pub fn first(&self) -> &T {
        &self.head
    }
    /// Returns a reference to the last element.
    pub fn last(&self) -> &T {
        self.tail.last().unwrap_or(&self.head)
    }
    /// Returns the number of elements.
    pub fn len(&self) -> usize {
        1 + self.tail.len()
    }
    /// Returns whether the collection is empty.
    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }
    /// Returns all elements as a Vec.
    pub fn to_vec(&self) -> Vec<&T> {
        let mut v = vec![&self.head];
        v.extend(self.tail.iter());
        v
    }
}
/// A pool of reusable string buffers.
#[allow(dead_code)]
pub struct StringPool {
    free: Vec<String>,
}
#[allow(dead_code)]
impl StringPool {
    /// Creates a new empty string pool.
    pub fn new() -> Self {
        Self { free: Vec::new() }
    }
    /// Takes a string from the pool (may be empty).
    pub fn take(&mut self) -> String {
        self.free.pop().unwrap_or_default()
    }
    /// Returns a string to the pool.
    pub fn give(&mut self, mut s: String) {
        s.clear();
        self.free.push(s);
    }
    /// Returns the number of free strings in the pool.
    pub fn free_count(&self) -> usize {
        self.free.len()
    }
}
/// Represents a rewrite rule `lhs → rhs`.
#[allow(dead_code)]
#[allow(missing_docs)]
pub struct RewriteRule {
    /// The name of the rule.
    pub name: String,
    /// A string representation of the LHS pattern.
    pub lhs: String,
    /// A string representation of the RHS.
    pub rhs: String,
    /// Whether this is a conditional rule (has side conditions).
    pub conditional: bool,
}
#[allow(dead_code)]
impl RewriteRule {
    /// Creates an unconditional rewrite rule.
    pub fn unconditional(
        name: impl Into<String>,
        lhs: impl Into<String>,
        rhs: impl Into<String>,
    ) -> Self {
        Self {
            name: name.into(),
            lhs: lhs.into(),
            rhs: rhs.into(),
            conditional: false,
        }
    }
    /// Creates a conditional rewrite rule.
    pub fn conditional(
        name: impl Into<String>,
        lhs: impl Into<String>,
        rhs: impl Into<String>,
    ) -> Self {
        Self {
            name: name.into(),
            lhs: lhs.into(),
            rhs: rhs.into(),
            conditional: true,
        }
    }
    /// Returns a textual representation.
    pub fn display(&self) -> String {
        format!("{}: {} → {}", self.name, self.lhs, self.rhs)
    }
}
/// A type-erased function pointer with arity tracking.
#[allow(dead_code)]
pub struct RawFnPtr {
    /// The raw function pointer (stored as usize for type erasure).
    ptr: usize,
    arity: usize,
    name: String,
}
#[allow(dead_code)]
impl RawFnPtr {
    /// Creates a new raw function pointer descriptor.
    pub fn new(ptr: usize, arity: usize, name: impl Into<String>) -> Self {
        Self {
            ptr,
            arity,
            name: name.into(),
        }
    }
    /// Returns the arity.
    pub fn arity(&self) -> usize {
        self.arity
    }
    /// Returns the name.
    pub fn name(&self) -> &str {
        &self.name
    }
    /// Returns the raw pointer value.
    pub fn raw(&self) -> usize {
        self.ptr
    }
}
/// A write-once cell.
#[allow(dead_code)]
pub struct WriteOnce<T> {
    value: std::cell::Cell<Option<T>>,
}
#[allow(dead_code)]
impl<T: Copy> WriteOnce<T> {
    /// Creates an empty write-once cell.
    pub fn new() -> Self {
        Self {
            value: std::cell::Cell::new(None),
        }
    }
    /// Writes a value.  Returns `false` if already written.
    pub fn write(&self, val: T) -> bool {
        if self.value.get().is_some() {
            return false;
        }
        self.value.set(Some(val));
        true
    }
    /// Returns the value if written.
    pub fn read(&self) -> Option<T> {
        self.value.get()
    }
    /// Returns `true` if the value has been written.
    pub fn is_written(&self) -> bool {
        self.value.get().is_some()
    }
}
/// A record describing the structure of a proof term for analysis.
#[allow(dead_code)]
#[derive(Debug, Clone)]
pub struct ProofAnalysis {
    /// Total AST node count.
    pub size: usize,
    /// Maximum nesting depth.
    pub depth: usize,
    /// Number of lambda abstractions.
    pub lambda_count: usize,
    /// Number of applications.
    pub app_count: usize,
    /// Number of let-bindings.
    pub let_count: usize,
    /// Number of free variables referenced.
    pub fvar_count: usize,
    /// Number of bound variable references.
    pub bvar_count: usize,
    /// Whether the term contains any classical axiom.
    pub uses_classical: bool,
    /// Names of all constants referenced.
    pub constants: HashSet<Name>,
}
impl ProofAnalysis {
    /// Analyse a proof term and return a `ProofAnalysis`.
    #[allow(dead_code)]
    pub fn analyse(term: &Expr) -> Self {
        let mut analysis = ProofAnalysis {
            size: 0,
            depth: 0,
            lambda_count: 0,
            app_count: 0,
            let_count: 0,
            fvar_count: 0,
            bvar_count: 0,
            uses_classical: false,
            constants: HashSet::new(),
        };
        analysis.visit(term, 0);
        analysis.depth = ProofTerm::depth(term);
        analysis.uses_classical = !ProofTerm::is_constructive(term);
        analysis
    }
    fn visit(&mut self, term: &Expr, _depth: usize) {
        self.size += 1;
        match term {
            Expr::BVar(_) => {
                self.bvar_count += 1;
            }
            Expr::FVar(_) => {
                self.fvar_count += 1;
            }
            Expr::Const(name, _) => {
                self.constants.insert(name.clone());
            }
            Expr::Sort(_) | Expr::Lit(_) => {}
            Expr::App(f, a) => {
                self.app_count += 1;
                self.visit(f, _depth + 1);
                self.visit(a, _depth + 1);
            }
            Expr::Lam(_, _, ty, body) => {
                self.lambda_count += 1;
                self.visit(ty, _depth + 1);
                self.visit(body, _depth + 1);
            }
            Expr::Pi(_, _, ty, body) => {
                self.visit(ty, _depth + 1);
                self.visit(body, _depth + 1);
            }
            Expr::Let(_, ty, val, body) => {
                self.let_count += 1;
                self.visit(ty, _depth + 1);
                self.visit(val, _depth + 1);
                self.visit(body, _depth + 1);
            }
            Expr::Proj(_, _, e) => {
                self.visit(e, _depth + 1);
            }
        }
    }
}
/// A simple stack-based calculator for arithmetic expressions.
#[allow(dead_code)]
pub struct StackCalc {
    stack: Vec<i64>,
}
#[allow(dead_code)]
impl StackCalc {
    /// Creates a new empty calculator.
    pub fn new() -> Self {
        Self { stack: Vec::new() }
    }
    /// Pushes an integer literal.
    pub fn push(&mut self, n: i64) {
        self.stack.push(n);
    }
    /// Replaces the top two values, `b` on top of `a`, with `op(a, b)` and
    /// returns it.  Returns `None`, leaving the stack unchanged, if it holds
    /// fewer than two values.
    fn apply_binary(&mut self, op: impl FnOnce(i64, i64) -> i64) -> Option<i64> {
        let (rest_len, a, b) = match self.stack[..] {
            [ref rest @ .., a, b] => (rest.len(), a, b),
            _ => return None,
        };
        let value = op(a, b);
        self.stack.truncate(rest_len);
        self.stack.push(value);
        Some(value)
    }
    /// Adds the top two values and returns the sum, which replaces them.
    /// Returns `None`, leaving the stack unchanged, if it holds fewer than
    /// two values.
    pub fn add(&mut self) -> Option<i64> {
        self.apply_binary(|a, b| a + b)
    }
    /// Subtracts top from second and returns the difference, which replaces
    /// them.  Returns `None`, leaving the stack unchanged, if it holds fewer
    /// than two values.
    pub fn sub(&mut self) -> Option<i64> {
        self.apply_binary(|a, b| a - b)
    }
    /// Multiplies the top two values and returns the product, which replaces
    /// them.  Returns `None`, leaving the stack unchanged, if it holds fewer
    /// than two values.
    pub fn mul(&mut self) -> Option<i64> {
        self.apply_binary(|a, b| a * b)
    }
    /// Peeks the top value.
    pub fn peek(&self) -> Option<i64> {
        self.stack.last().copied()
    }
    /// Returns the stack depth.
    pub fn depth(&self) -> usize {
        self.stack.len()
    }
}
/// A tagged union for representing a simple two-case discriminated union.
#[allow(dead_code)]
pub enum Either2<A, B> {
    /// The first alternative.
    First(A),
    /// The second alternative.
    Second(B),
}
#[allow(dead_code)]
impl<A, B> Either2<A, B> {
    /// Returns `true` if this is the first alternative.
    pub fn is_first(&self) -> bool {
        matches!(self, Either2::First(_))
    }
    /// Returns `true` if this is the second alternative.
    pub fn is_second(&self) -> bool {
        matches!(self, Either2::Second(_))
    }
    /// Returns the first value if present.
    pub fn first(self) -> Option<A> {
        match self {
            Either2::First(a) => Some(a),
            _ => None,
        }
    }
    /// Returns the second value if present.
    pub fn second(self) -> Option<B> {
        match self {
            Either2::Second(b) => Some(b),
            _ => None,
        }
    }
    /// Maps over the first alternative.
    pub fn map_first<C, F: FnOnce(A) -> C>(self, f: F) -> Either2<C, B> {
        match self {
            Either2::First(a) => Either2::First(f(a)),
            Either2::Second(b) => Either2::Second(b),
        }
    }
}
/// A simple mutable key-value store for test fixtures.
#[allow(dead_code)]
pub struct Fixture {
    data: std::collections::HashMap<String, String>,
}
#[allow(dead_code)]
impl Fixture {
    /// Creates an empty fixture.
    pub fn new() -> Self {
        Self {
            data: std::collections::HashMap::new(),
        }
    }
    /// Sets a key.
    pub fn set(&mut self, key: impl Into<String>, val: impl Into<String>) {
        self.data.insert(key.into(), val.into());
    }
    /// Gets a value.
    pub fn get(&self, key: &str) -> Option<&str> {
        self.data.get(key).map(|s| s.as_str())
    }
    /// Returns the number of entries.
    pub fn len(&self) -> usize {
        self.data.len()
    }
    /// Returns whether the collection is empty.
    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }
}
/// A simple decision tree node for rule dispatching.
#[allow(dead_code)]
#[allow(missing_docs)]
pub enum DecisionNode {
    /// A leaf with an action string.
    Leaf(String),
    /// An interior node: check `key` equals `val` → `yes_branch`, else `no_branch`.
    Branch {
        key: String,
        val: String,
        yes_branch: Box<DecisionNode>,
        no_branch: Box<DecisionNode>,
    },
}
#[allow(dead_code)]
impl DecisionNode {
    /// Evaluates the decision tree with the given context.
    pub fn evaluate(&self, ctx: &std::collections::HashMap<String, String>) -> &str {
        match self {
            DecisionNode::Leaf(action) => action.as_str(),
            DecisionNode::Branch {
                key,
                val,
                yes_branch,
                no_branch,
            } => {
                let actual = ctx.get(key).map(|s| s.as_str()).unwrap_or("");
                if actual == val.as_str() {
                    yes_branch.evaluate(ctx)
                } else {
                    no_branch.evaluate(ctx)
                }
            }
        }
    }
    /// Returns the depth of the decision tree.
    pub fn depth(&self) -> usize {
        match self {
            DecisionNode::Leaf(_) => 0,
            DecisionNode::Branch {
                yes_branch,
                no_branch,
                ..
            } => 1 + yes_branch.depth().max(no_branch.depth()),
        }
    }
}
/// A mutable reference stack for tracking the current "focus" in a tree traversal.
#[allow(dead_code)]
pub struct FocusStack<T> {
    items: Vec<T>,
}
#[allow(dead_code)]
impl<T> FocusStack<T> {
    /// Creates an empty focus stack.
    pub fn new() -> Self {
        Self { items: Vec::new() }
    }
    /// Focuses on `item`.
    pub fn focus(&mut self, item: T) {
        self.items.push(item);
    }
    /// Blurs (pops) the current focus.
    pub fn blur(&mut self) -> Option<T> {
        self.items.pop()
    }
    /// Returns the current focus, or `None`.
    pub fn current(&self) -> Option<&T> {
        self.items.last()
    }
    /// Returns the focus depth.
    pub fn depth(&self) -> usize {
        self.items.len()
    }
    /// Returns `true` if there is no current focus.
    pub fn is_empty(&self) -> bool {
        self.items.is_empty()
    }
}
/// A counter that can measure elapsed time between snapshots.
#[allow(dead_code)]
pub struct Stopwatch {
    start: crate::wall_clock::Instant,
    splits: Vec<f64>,
}
#[allow(dead_code)]
impl Stopwatch {
    /// Creates and starts a new stopwatch.
    pub fn start() -> Self {
        Self {
            start: crate::wall_clock::Instant::now(),
            splits: Vec::new(),
        }
    }
    /// Records a split time (elapsed since start).
    pub fn split(&mut self) {
        self.splits.push(self.elapsed_ms());
    }
    /// Returns total elapsed milliseconds since start.
    pub fn elapsed_ms(&self) -> f64 {
        self.start.elapsed().as_secs_f64() * 1000.0
    }
    /// Returns all recorded split times.
    pub fn splits(&self) -> &[f64] {
        &self.splits
    }
    /// Returns the number of splits.
    pub fn num_splits(&self) -> usize {
        self.splits.len()
    }
}
/// A sparse vector: stores only non-default elements.
#[allow(dead_code)]
pub struct SparseVec<T: Default + Clone + PartialEq> {
    entries: std::collections::HashMap<usize, T>,
    default_: T,
    logical_len: usize,
}
#[allow(dead_code)]
impl<T: Default + Clone + PartialEq> SparseVec<T> {
    /// Creates a new sparse vector with logical length `len`.
    pub fn new(len: usize) -> Self {
        Self {
            entries: std::collections::HashMap::new(),
            default_: T::default(),
            logical_len: len,
        }
    }
    /// Sets element at `idx`.
    pub fn set(&mut self, idx: usize, val: T) {
        if val == self.default_ {
            self.entries.remove(&idx);
        } else {
            self.entries.insert(idx, val);
        }
    }
    /// Gets element at `idx`.
    pub fn get(&self, idx: usize) -> &T {
        self.entries.get(&idx).unwrap_or(&self.default_)
    }
    /// Returns the logical length.
    pub fn len(&self) -> usize {
        self.logical_len
    }
    /// Returns whether the collection is empty.
    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }
    /// Returns the number of non-default elements.
    pub fn nnz(&self) -> usize {
        self.entries.len()
    }
}
/// A proof certificate: a self-contained record attesting that a term
/// is a valid proof of a proposition.
#[allow(dead_code)]
#[derive(Clone, Debug)]
pub struct ProofCertificate {
    /// The proven proposition.
    pub proposition: Expr,
    /// The proof term.
    pub proof_term: Expr,
    /// Whether the proof is constructive.
    pub is_constructive: bool,
    /// Whether the proof contains any `sorry`.
    pub has_sorry: bool,
}
impl ProofCertificate {
    /// Create a certificate from a proposition and proof term.
    #[allow(dead_code)]
    pub fn new(proposition: Expr, proof_term: Expr) -> Self {
        let is_constructive = ProofAnalyzer::is_constructive(&proof_term);
        let has_sorry = crate::proof::contains_classical_sorry(&proof_term);
        Self {
            proposition,
            proof_term,
            is_constructive,
            has_sorry,
        }
    }
    /// Whether this certificate is fully trusted (no sorry, constructive).
    #[allow(dead_code)]
    pub fn is_trusted(&self) -> bool {
        !self.has_sorry && self.is_constructive
    }
}
/// A token bucket rate limiter.
#[allow(dead_code)]
pub struct TokenBucket {
    capacity: u64,
    tokens: u64,
    refill_per_ms: u64,
    last_refill: crate::wall_clock::Instant,
}
#[allow(dead_code)]
impl TokenBucket {
    /// Creates a new token bucket.
    pub fn new(capacity: u64, refill_per_ms: u64) -> Self {
        Self {
            capacity,
            tokens: capacity,
            refill_per_ms,
            last_refill: crate::wall_clock::Instant::now(),
        }
    }
    /// Attempts to consume `n` tokens.  Returns `true` on success.
    pub fn try_consume(&mut self, n: u64) -> bool {
        self.refill();
        if self.tokens >= n {
            self.tokens -= n;
            true
        } else {
            false
        }
    }
    fn refill(&mut self) {
        let now = crate::wall_clock::Instant::now();
        let elapsed_ms = now.duration_since(self.last_refill).as_millis() as u64;
        if elapsed_ms > 0 {
            let new_tokens = elapsed_ms * self.refill_per_ms;
            self.tokens = (self.tokens + new_tokens).min(self.capacity);
            self.last_refill = now;
        }
    }
    /// Returns the number of currently available tokens.
    pub fn available(&self) -> u64 {
        self.tokens
    }
    /// Returns the bucket capacity.
    pub fn capacity(&self) -> u64 {
        self.capacity
    }
}
/// A hierarchical configuration tree.
#[allow(dead_code)]
pub struct ConfigNode {
    key: String,
    value: Option<String>,
    children: Vec<ConfigNode>,
}
#[allow(dead_code)]
impl ConfigNode {
    /// Creates a leaf config node with a value.
    pub fn leaf(key: impl Into<String>, value: impl Into<String>) -> Self {
        Self {
            key: key.into(),
            value: Some(value.into()),
            children: Vec::new(),
        }
    }
    /// Creates a section node with children.
    pub fn section(key: impl Into<String>) -> Self {
        Self {
            key: key.into(),
            value: None,
            children: Vec::new(),
        }
    }
    /// Adds a child node.
    pub fn add_child(&mut self, child: ConfigNode) {
        self.children.push(child);
    }
    /// Returns the key.
    pub fn key(&self) -> &str {
        &self.key
    }
    /// Returns the value, or `None` for section nodes.
    pub fn value(&self) -> Option<&str> {
        self.value.as_deref()
    }
    /// Returns the number of children.
    pub fn num_children(&self) -> usize {
        self.children.len()
    }
    /// Looks up a dot-separated path.
    pub fn lookup(&self, path: &str) -> Option<&str> {
        let mut parts = path.splitn(2, '.');
        let head = parts.next()?;
        let tail = parts.next();
        if head != self.key {
            return None;
        }
        match tail {
            None => self.value.as_deref(),
            Some(rest) => self.children.iter().find_map(|c| c.lookup_relative(rest)),
        }
    }
    fn lookup_relative(&self, path: &str) -> Option<&str> {
        let mut parts = path.splitn(2, '.');
        let head = parts.next()?;
        let tail = parts.next();
        if head != self.key {
            return None;
        }
        match tail {
            None => self.value.as_deref(),
            Some(rest) => self.children.iter().find_map(|c| c.lookup_relative(rest)),
        }
    }
}
/// A versioned record that stores a history of values.
#[allow(dead_code)]
pub struct VersionedRecord<T: Clone> {
    /// Every earlier value, oldest first: version `n` is `earlier[n]`.
    earlier: Vec<T>,
    /// The latest value (version `earlier.len()`), declared last so it drops last.
    current: T,
}
#[allow(dead_code)]
impl<T: Clone> VersionedRecord<T> {
    /// Creates a new record with an initial value.
    pub fn new(initial: T) -> Self {
        Self {
            earlier: Vec::new(),
            current: initial,
        }
    }
    /// Updates the record with a new version.
    pub fn update(&mut self, val: T) {
        let previous = std::mem::replace(&mut self.current, val);
        self.earlier.push(previous);
    }
    /// Returns the current (latest) value.
    pub fn current(&self) -> &T {
        &self.current
    }
    /// Returns the value at version `n` (0-indexed), or `None`.
    pub fn at_version(&self, n: usize) -> Option<&T> {
        match self.earlier.get(n) {
            Some(value) => Some(value),
            None if n == self.earlier.len() => Some(&self.current),
            None => None,
        }
    }
    /// Returns the version number of the current value.
    pub fn version(&self) -> usize {
        self.earlier.len()
    }
    /// Returns `true` if more than one version exists.
    pub fn has_history(&self) -> bool {
        !self.earlier.is_empty()
    }
}
/// A min-heap implemented as a binary heap.
#[allow(dead_code)]
pub struct MinHeap<T: Ord> {
    data: Vec<T>,
}
#[allow(dead_code)]
impl<T: Ord> MinHeap<T> {
    /// Creates a new empty min-heap.
    pub fn new() -> Self {
        Self { data: Vec::new() }
    }
    /// Inserts an element.
    pub fn push(&mut self, val: T) {
        self.data.push(val);
        self.sift_up(self.data.len() - 1);
    }
    /// Removes and returns the minimum element.
    pub fn pop(&mut self) -> Option<T> {
        if self.data.is_empty() {
            return None;
        }
        let n = self.data.len();
        self.data.swap(0, n - 1);
        let min = self.data.pop();
        if !self.data.is_empty() {
            self.sift_down(0);
        }
        min
    }
    /// Returns a reference to the minimum element.
    pub fn peek(&self) -> Option<&T> {
        self.data.first()
    }
    /// Returns the number of elements.
    pub fn len(&self) -> usize {
        self.data.len()
    }
    /// Returns `true` if empty.
    pub fn is_empty(&self) -> bool {
        self.data.is_empty()
    }
    fn sift_up(&mut self, mut i: usize) {
        while i > 0 {
            let parent = (i - 1) / 2;
            if self.data[i] < self.data[parent] {
                self.data.swap(i, parent);
                i = parent;
            } else {
                break;
            }
        }
    }
    fn sift_down(&mut self, mut i: usize) {
        let n = self.data.len();
        loop {
            let left = 2 * i + 1;
            let right = 2 * i + 2;
            let mut smallest = i;
            if left < n && self.data[left] < self.data[smallest] {
                smallest = left;
            }
            if right < n && self.data[right] < self.data[smallest] {
                smallest = right;
            }
            if smallest == i {
                break;
            }
            self.data.swap(i, smallest);
            i = smallest;
        }
    }
}
/// Represents a single obligation in a proof: a goal that must be closed.
#[allow(dead_code)]
#[derive(Debug, Clone)]
pub struct ProofObligation {
    /// A human-readable label for this obligation.
    pub label: String,
    /// The proposition that must be proved.
    pub proposition: Expr,
    /// Whether this obligation has been discharged.
    pub discharged: bool,
    /// The proof term supplied, if any.
    pub proof_term: Option<Expr>,
}
impl ProofObligation {
    /// Create a new undischarged obligation.
    #[allow(dead_code)]
    pub fn new(label: impl Into<String>, proposition: Expr) -> Self {
        ProofObligation {
            label: label.into(),
            proposition,
            discharged: false,
            proof_term: None,
        }
    }
    /// Discharge this obligation with a given proof term.
    #[allow(dead_code)]
    pub fn discharge(&mut self, proof: Expr) {
        self.proof_term = Some(proof);
        self.discharged = true;
    }
    /// Returns true if this obligation has been discharged.
    #[allow(dead_code)]
    pub fn is_discharged(&self) -> bool {
        self.discharged
    }
}