Foster, Simon and Struth, Georg
(Submitted: 2011)
Integrating an Automated Theorem Prover into Agda.
In:
NASA Formal Methods Symposium.
NASA Formal Methods Symposium, 18-20 Apr 2011, Pasadena, CA.
Lecture Notes in Computer Science
(6617).
Springer
, pp. 116-130.
Abstract
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.
Metadata
Item Type:
Proceedings Paper
Authors/Creators:
Foster, Simon (s.foster@dcs.shef.ac.uk)
Struth, Georg (g.struth@dcs.shef.ac.uk)
Copyright, Publisher and Additional Information:
Copyright Springer, 2011. This is an author produced version of the published paper. Uploaded in accordance with the publisher's self-archiving policy.
![[thumbnail of nasafm11_front.pdf]](https://eprints.whiterose.ac.uk/style/images/fileicons/text.png "nasafm11_front.pdf")
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)