Matching-Logic-Based Understanding of Polynomial Functors and their Initial/Final Models Revisited
The paper gives matching-logic specifications for initial algebras and final coalgebras of polynomial functors represented as unary container functors. It proves the extracted algebras and coalgebras are W- and M-types relative to shape and position interpretations, derives induction and bisimulation principles, and revises an EPTCS 389 paper with corrected axioms and new proofs.