3 papers
cs.FL2026
Tree Equivalence of Higher-Order Recursion Schemes Is Undecidable
Mingkun Xiao, Yixuan Sun
Higher-order recursion schemes (HORS) are finite, simply typed recursive programs that generate potentially infinite trees. Their monadic second-order model-checking problem is dec…
cs.LG2026
Beyond Expert Rankings: Contrast Calibration for Mixed-Precision MoE Quantization
Renjie Xie, Juncheng Yang, Aoting Hu +5
Mixture-of-experts (MoE) language models activate only a few experts per token, yet all expert weights must be stored. Mixed-precision quantization reduces this storage cost by ass…
cs.LO2026
An Explicit Ordinal Bound for System T Dialogue Trees
MingKun Xiao, YiXuan Sun
Escardó's dialogue interpretation assigns to each closed term of Gödel's System~T a well-founded, countably branching tree , where is the natural-number t…