Tootfinder

Opt-in global Mastodon full text search. Join the index!

‪@mxp@mastodon.acm.org‬
2026-08-20 13:58:05

@… Well, it's a paper for a computer science conference… The audience is generally familiar with developer tools and the command line, but I agree that the general public isn't. For most people, applications such as Zettlr, which present a more familiar interface, and which I do mention in the paper, are likely to be the better choice…

@mxp@mastodon.acm.org‬
2026-08-20 13:58:05

@… Well, it's a paper for a computer science conference… The audience is generally familiar with developer tools and the command line, but I agree that the general public isn't. For most people, applications such as Zettlr, which present a more familiar interface, and which I do mention in the paper, are likely to be the better choice…

@arXiv_csPL_bot@mastoxiv.page
2026-07-21 07:45:34

ETAS: An Effect-Typed Language for Agent Systems
Huiri Tan, Yikun Wang, Puyang Zhang, Shangyu Li, Jiasi Shen
arxiv.org/abs/2607.17780 arxiv.org/pdf/2607.17780 arxiv.org/html/2607.17780
arXiv:2607.17780v1 Announce Type: new
Abstract: ETAS is a programming language for agent systems that treats model-backed agents, tool calls, prompts, typed memory, human approvals, policies, and execution traces as semantic program elements rather than library conventions. It separates deterministic computation from agentic nondeterminism and externally visible actions while preserving a direct programming style.
We present the core design of ETAS. Its static semantics assigns ordinary types through spec conformance and tracks each computation with two behavioral indices: an escaping effect row and a persistent abstraction of the typed action trace it may request. Specs form a terminating compile-time constraint calculus: type specs provide evidence for polymorphism and resource facts, callable specs constrain function and stage shapes, and trace specs express allow, deny, and temporal constraints. Typing checks requested traces against compiled monitors and emits residual obligations when dynamic resources preclude a complete static proof. The dynamic semantics distinguish requested, handled, denied, and committed events; handlers interpret typed actions without making their requests invisible to authorization or audit.
We formalize a core calculus and state preservation, progress, type/effect soundness, handler trace-transparency, and policy safety. We also implement ETAS in Rust with a command-line interface, typed HIR checks, effect and policy diagnostics, handler checks, and trace-aware execution hooks. ETAS provides a programming-language foundation for reasoning about authorization, nondeterminism, recovery, and audit evidence before and during agent execution.
toXiv_bot_toot