Algorithms are defined as finite directed graphs with edges labelled by partial maps on abstract data structures, with programs implementing them via step correspondences that preserve data transformations in monoid-action models.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Mathematical Informatics: Algorithms
Algorithms are defined as finite directed graphs with edges labelled by partial maps on abstract data structures, with programs implementing them via step correspondences that preserve data transformations in monoid-action models.