Abstract
Theory exploration is a technique for automating the discovery of lemmas in formalizations of mathematical theories, using testing and automated proof techniques. Automated theory exploration has previously been successfully applied to discover lemmas for inductive theories, about recursive datatypes and functions. We present an extension of theory exploration to coinductive theories, allowing us to explore the dual notions of corecursive datatypes and functions. This required development of new methods for testing infinite values, and for proof automation. Our work has been implemented in the Hipster system, a theory exploration tool for the proof assistant Isabelle/HOL.
Cite
CITATION STYLE
Einarsdóttir, S. H., Johansson, M., & Åman Pohjola, J. (2018). Into the infinite - theory exploration for coinduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11110 LNAI, pp. 70–86). Springer Verlag. https://doi.org/10.1007/978-3-319-99957-9_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
