Skip to main content

Into the infinite - theory exploration for coinduction


Solrun Halla Einarsdottir, Moa Johansson and Johannes Aman Pohjola


Chalmers University of Technology


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.

BibTeX Entry

    publisher        = {Springer},
    doi              = {10.1007/978-3-319-99957-9\_5},
    series           = {Lecture Notes in Computer Science, Volume 11110},
    booktitle        = {Artificial Intelligence and Symbolic Computation},
    author           = {Einarsdottir, Solrun Halla and Johansson, Moa and Aman Pohjola, Johannes},
    volume           = {11110},
    editor           = {{Fleuriot, Jacques D. and Wang, Dongming and Calmet, Jacques}},
    year             = {2018},
    title            = {Into the Infinite - Theory Exploration for Coinduction},
    pages            = {70-86},
    address          = {Suzhou, China}


Served by Apache on Linux on seL4.