Mechanizing Coinduction and Corecursion in Higher-order Logic
<|reference_start|>Mechanizing Coinduction and Corecursion in Higher-order Logic: A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanized using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express coinductive data types, such as lazy lists. Well-founded recursion expresses recursive functions over inductive data types; corecursion expresses functions that yield elements of coinductive data types. The theory rests on a traditional formalization of infinite trees. The theory is intended for use in specification and verification. It supports reasoning about a wide range of computable functions, but it does not formalize their operational semantics and can express noncomputable functions also. The theory is illustrated using finite and infinite lists. Corecursion expresses functions over infinite lists; coinduction reasons about such functions.<|reference_end|>
@article{paulson2000mechanizing,
    title={Mechanizing Coinduction and Corecursion in Higher-order Logic},
    author={Lawrence C. Paulson},
    journal={published in Journal of Logic and Computation 7 (March 1997),
  175-204},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/9711105},
    primaryClass={cs.LO}
}