Applied & Human-Centered · Computer Science & AI
Programming Languages
The newest papers in Programming Languages that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
81 papers, from 4 September 2026 to 4 November 2026: 81 arXiv preprints.
Get the few papers worth your time in Programming Languages every morning.
Follow Programming Languages and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 4
Semantic Prefix Oracles for LLM Decoding: Contracts and Differential Validation
Constrained decoding can enforce regular or context-free output formats, but many program-generation failures are semantic: scope, typing, and declaration effects depend on context.Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction
Equivalence checking is essential for validating compiler transformations of hybrid quantum programs, which combine quantum operations, measurements, and classical control.Neuro-Symbolic Indirect-Call Analysis under Opaque Pointers
Resolving indirect calls is central to call-graph construction for C. Scalable type-based analyses such as MLTA use type information in LLVM IR to associate indirect calls with functions assigned to…Agents as Software: A Programming Languages Agenda for Agent Reliability
AI agents increasingly resemble software systems: they call tools, remember facts, follow policies, delegate work, and take actions with real consequences. % Yet the ``program'' of an agent is…Automated Abstraction Refinement for Information Flow Security in Embedded Systems
Information flow analysis (IFA) is a powerful technique for verifying confidentiality and integrity and is therefore highly desirable for security-sensitive embedded systems.MQSS-Selector: RL-Guided Pass Selection for an MLIR Compilation Pipeline
High Performance Computing (HPC) and Quantum Computing (QC) systems are increasingly converging towards unified High Performance Computing-Quantum Computing (HPCQC) infrastructures, driven by a…Foundations of Algebraic Architecture Theory: A Rising Sea of Geometry, Transport, Comparison, and Reconstruction
AI-generated software changes make it increasingly important to determine what a change preserves, where local consistency fails to extend globally, and which alternatives remain.Pack Iteration in Swift: Ordinary Control Flow for Variadic Generics
Variadic generics are a powerful tool for type-safe meta-programming.Synthesizing Proofs Using Proof Sharding and Exploration
Distributed systems are hard to implement correctly, and subtle bugs can go undetected using traditional testing.Djinnlang: Higher-Level Programming by Unambiguous Specification with an LLM in the Compiler
Programmers write formal specifications, and LLMs implement them, proving that each implementation matches its spec.Beyond Natural Language: An Agent-Native Language for Autonomous Science
As autonomous AI agents take on every stage of scientific inquiry, research output is expanding far beyond human review capacity.Modular Composition of Inductive Types Using Lean Meta-programming
Inductive types are ubiquitous building blocks in many programming and theorem proving languages.TRACTOR Benchmark for Evaluating C to Rust Translators
Memory-safety vulnerabilities remain a persistent source of security risk in critical software, much of which is implemented in memory-unsafe languages such as C and C++.Authorization Revocation for Long-Running AI Agents: Root-Scoped Quiescence under Delegation and Asynchronous Execution
Long-running AI agents outlive initiating processes through credentials, delegated tasks, queues, callbacks, reservations, and provider-side operations.Detecting Soft Errors in Parallel Software with LLM-tuned Instruction Duplication
We propose PaRID (PaRallel Instruction Duplication), a software-directed soft error detection framework that requires only compile-time effort for multithreading parallel programs.The Output-Space Hypothesis: Enumerative Equivalence Checking for Tensor Programs
Tensor programs, as used in deep learning models, are a prime target for optimization, as small performance improvements can have a large impact across training or inference workloads.The AR Fairness Metamodel: A Structured Framework for Fairness Measures
This paper presents the AR fairness metamodel, a framework designed to represent, analyze, and compare different fairness scenarios.Beyond Token-Local Imitation: Reward-Compatible Temporal Credit Assignment for On-Policy Distillation
On-policy distillation (OPD) has emerged as an effective approach for large language model post-training, yet existing objectives face a trade-off between objective fidelity and optimization…Assurance Envelopes for Autonomous Coding Agents: Minimum-Cost Evidence for Software Change
When a coding agent returns to existing software, it inherits evidence from earlier engineering work: tests, type checks, proofs, static analyses, and traces.GPU-CFR: 80x Faster Counterfactual Regret Minimization by Compiling the Game to Static Dataflow and CUDA Graph Replay
Counterfactual regret minimization (CFR) is one of the few large numerical workloads that still runs faster on CPUs than on GPUs.