AIC is a new equational algebra for deriving fixed points from iterations that proves the Tarski-Kantorovich principle, a k-induction generalization, and a novel limit-inf/sup theorem, with Isabelle mechanization and completeness analysis.
A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
The Algebra of Iterative Constructions
AIC is a new equational algebra for deriving fixed points from iterations that proves the Tarski-Kantorovich principle, a k-induction generalization, and a novel limit-inf/sup theorem, with Isabelle mechanization and completeness analysis.