Hipster

swMATH11223MaRDI QIDQ23170FDOQ23170

Author name not available (Why is that?)

Described by source

• Automated theory exploration for interactive theorem proving: an introduction to the Hipster system
• Hipster: Integrating Theory Exploration in a Proof Assistant

Cited In (8)

• TIP: Tools for Inductive Provers
• Proof mining with dependent types
• TIP: Tons of Inductive Problems
• Lemma discovery for induction. A survey
• Theory exploration powered by deductive synthesis
• Unprovability results for clause set cycles
• Induction and Skolemization in saturation theorem proving
• Quick specifications for the busy programmer

This page was built for software: Hipster