The Size-Change Principle for Mixed Inductive and Coinductive types
<|reference_start|>The Size-Change Principle for Mixed Inductive and Coinductive types: This paper shows how to use Lee, Jones and Ben Amram's size-change principle to check correctness of arbitrary recursive definitions in an ML / Haskell like programming language with inductive and coinductive types.Naively using the size-change principle to check productivity and termination is straightforward but unsound when inductive and coinductive types arenested. We can however adapt the size-change principle to check ``totality'', which corresponds exactly to correctness with respect to the corresponding (co)inductive type.<|reference_end|>
@article{hyvernat2024the,
    title={The Size-Change Principle for Mixed Inductive and Coinductive types},
    author={Pierre Hyvernat (LAMA)},
    journal={arXiv preprint arXiv:2407.05715},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.05715},
    primaryClass={cs.LO}
}