A call-by-value lambda calculus with LLM generation and dynamic labels is shown to satisfy termination-insensitive noninterference on a restricted fragment, with a supposedly Lean-verified interpreter.
Fundamental concepts in programming languages,
1 Pith paper cite this work, alongside 278 external citations. Polarity classification is still indexing.
1
Pith paper citing it
278
external citations · OpenAlex
fields
cs.PL 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
The LLMbda Calculus: AI Agents, Conversations, and Information Flow
A call-by-value lambda calculus with LLM generation and dynamic labels is shown to satisfy termination-insensitive noninterference on a restricted fragment, with a supposedly Lean-verified interpreter.