XML prompting is formalized as fixed-point iteration over an XML-tree lattice, with convergence claimed via Knaster-Tarski and Banach theorems, plus example XML recipe templates.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
XML Prompting as Grammar-Constrained Interaction: Fixed-Point Semantics, Convergence Guarantees, and Human-AI Protocols
XML prompting is formalized as fixed-point iteration over an XML-tree lattice, with convergence claimed via Knaster-Tarski and Banach theorems, plus example XML recipe templates.