Integrating an Automated Theorem Prover into Agda [chapter]

Simon Foster, Georg Struth
2011 Lecture Notes in Computer Science  
Agda is a dependently typed functional programming language and a proof assistant in which developing programs and proving their correctness is one activity. We show how this process can be enhanced by integrating external automated theorem provers, provide a prototypical integration of the equational theorem prover Waldmeister, and give examples of how this proof automation works in practice.
doi:10.1007/978-3-642-20398-5_10 fatcat:pky4fgexezagznablnklhse3em