3 papers
cs.PL2026
Build-Authorized Evidence for Opaque Calls: A Fail-Closed Rewrite-Authority Boundary
Zhonghua Yi
Detached semantic facts about opaque native providers do not by themselves justify compiler rewrites: rewrite authority must be confined to the accepted fact, selected provider and…
cs.PL2026
Toka: A Systems Programming Language with Explicit Resource Semantics
Zhonghua Yi
Systems programming languages traditionally struggle with the tension between physical transparency and compile-time memory safety. C++ provides direct, zero-cost hardware access b…
cs.CL2024
A Method for Building Large Language Models with Predefined KV Cache Capacity
Zhonghua Yi, Ge Niu, Lei Wang +2
This paper introduces a novel approach, the Bounded-Cache Transformer (BCT), for building large language models with a predefined Key-Value (KV) cache capacity. The BCT addresses t…