A generic type system with path-sensitive inference and template-based potential functions automatically confirms optimal amortized bounds for skew heaps and leftist heaps.
Mathematical Structures in Computer Science32(6), 794–826 (2022)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.PL 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
extend 1representative citing papers
citing papers explorer
-
Automated Amortised Analysis of Skew Heaps and Leftist Heaps (Extended Version)
A generic type system with path-sensitive inference and template-based potential functions automatically confirms optimal amortized bounds for skew heaps and leftist heaps.