WAMpy is a Python framework designed to efficiently synthesize Prolog programs by compiling Prolog clauses into NumPy array-based WAM instructions and enabling partial recompilation against fixed background knowledge. It accelerates performance-critical routines with Numba JIT compilation, and benchmarks show that WAMpy outperforms SWI-Prolog accessed from Python via Janus in repeated compilation-and-evaluation workloads.
arXiv:2609.37233v1 Announce Type: cross Abstract: Datalog underpins reasoning tasks such as program analysis, but its programs are hard to write. Existing synthesizers automate this task but require...
arXiv:2607. 18260v1 Announce Type: new Abstract: We introduce FindStatBench, an execution benchmark for evaluating large language models on combinatorial code synthesis.
Quasar is a new programming language designed to improve large language model (LLM) code actions by separating internal program logic from external tool calls. It allows developers to annotate external calls with effect information and modify internal execution to track these effects, enabling easier implementation of new features. The authors demonstrate Quasar’s utility by adding access control, autoparallelization, and conformal prediction for uncertainty quantification.
arXiv:2606. 14935v1 Announce Type: new Abstract: Frontier reasoning-tuned language models still fail on deductive tasks at depth, and the cost of improved performance through extended internal reasoning scales poorly.
HERO is a method that improves large language models for program generation by combining offline and test‑time harness optimization. It learns reusable prompt updates from execution‑verified successes and failures, validates candidate revisions before adoption, and then refines each generated code instance using execution feedback. On four SQL, Cypher, and Python benchmarks, HERO achieves the best offline performance, raising pass@1 by 7.6 points over the initial prompt and adding another 2.0 points through test‑time refinement while improving execution efficiency.
The paper introduces SWE-Flux, a repository‑level benchmark designed to test large language models’ ability to reason about runtime behavior. It contains 480 execution‑grounded instances from 12 real Python repositories, with gold answers automatically harvested from instrumented test executions. Evaluation of five LLMs shows the task remains difficult, with the best model achieving only 37% accuracy, and the benchmark can generate challenging variants through input perturbation.
The paper introduces ProloNg, a synthetic benchmark designed to test long-horizon deductive reasoning in language models using Prolog. It evaluates eight reasoning models from five leading LLM families on problems with reasoning depths up to 22 and context lengths of 62,000 tokens. Results show that model performance drops sharply as reasoning depth increases, with most models performing near chance beyond a depth of 10.
arXiv:2606. 10087v1 Announce Type: cross Abstract: Pre-training on raw code teaches syntax but provides sparse signal for diverse real-world task formats.
arXiv:2606. 12329v1 Announce Type: new Abstract: AI coding assistants now support a growing share of software work, from quick scripts to production applications.
arXiv:2608. 00130v2 Announce Type: replace-cross Abstract: Fortran has been the cornerstone of high-performance computing for decades and remains unmatched in many domains.
arXiv:2606. 10933v1 Announce Type: new Abstract: LLM-based coding agents are usually evaluated in familiar software settings: mainstream languages, common libraries, and public repositories.
arXiv:2607. 09217v1 Announce Type: new Abstract: In this system paper, we present OpenProver, an open-source system for LLM-driven automated theorem proving (ATP) with integrated Lean 4 formal verification.