Hipster

swMATH11223MaRDI QIDQ23170

No author found.

Described by source

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

Related Items (8)

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

This page was built for software: Hipster