SPL: Orchestrating Workflows with Declarative Deterministic-Probabilistic Composition
arXiv:2607.07727v1 Announce Type: cross Abstract: We present SPL (Structured Prompt Language), a declarative language that composes deterministic and probabilistic computation modes in a single…
Read the full articleYou might also wanna read
Separating Problem Solving from Code Generation: Evaluating LLMs on Competitive Programming Through Natural-Language Editorials
Large Language Models (LLMs) increasingly succeed on competitive programming problems, yet existing evaluations conflate algorithmic reasoni
arxiv.org·3d ago
Integrating Non-Deterministic AI Components into Deterministic Software Systems
by Eric Evans When we set out to incorporate AI components into larger systems that are mostly conventional software, we encounter various d
domainlanguage.com·5mo agoColored Petri Nets and LLMs: A Formal Approach to Verifiable Distributed Applications
A big theme in LLM-enabled software dev is that verifiable correctness makes it much easier to take bigger leaps with LLMs. E.g. tests, comp
Trustworthy Concurrency in the Agentic Lakehouse: Reconciling Academic Proofs with High-Frequency Production Writes
Agentic lakehouses change the concurrency conversation. Traditional data pipelines already deal with overlapping jobs, retries, compaction,
Technical Report: Using Predicate API as Verification Layer for Reliable AI Web Automation
Tutorials and insights on optimizing AI agents for web automation, visual cues, screenshot delivery, and reducing LLM costs.
sentienceapi.com·5mo ago
Formal Framework for LLM-Verifier Systems: Convergence Theorem and 4/δ Latency Bound
The integration of Formal Verification tools with Large Language Models (LLMs) offers a path to scale software verification beyond manual wo
arxiv.org·6mo ago
Comments
Sign in to join the conversation.
No comments yet. Be the first.