Into the infinite - theory exploration for coinduction
Paper in proceeding, 2018
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.
Author
Sólrún Einarsdóttir
Chalmers, Computer Science and Engineering (Chalmers), Functional Programming
Moa Johansson
Chalmers, Computer Science and Engineering (Chalmers), Formal methods
Johannes Åman Pohjala
Commonwealth Scientific and Industrial Research Organisation (CSIRO)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
Vol. 11110 LNAI 70-86
13th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2018
Suzhou, China,
Suzhou, China,
Subject Categories
Algebra and Logic
Other Engineering and Technologies not elsewhere specified
DOI
10.1007/978-3-319-99957-9_5