Similar Items: A tier-based typed programming language characterizing Feasible Functionals
- A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
- On tiered small jump operators
- Linear Dependent Type Theory for Quantum Programming Languages
- Bloch: a strongly typed, hardware-agnostic, hybrid quantum programming language
- Theory of higher order interpretations and application to Basic Feasible Functions
- PoolTA: Mitigating Migration Overhead in Memory Tiering for CXL-Based Systems