White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Integrating an Automated Theorem Prover into Agda

Foster, Simon and Struth, Georg (2011) Integrating an Automated Theorem Prover into Agda. In: NASA Formal Methods Symposium. NASA Formal Methods Symposium, 18-20 April 2011, Pasadena, CA. Lecture Notes in Computer Science (6617). Springer , pp. 116-130.

Full text available as:
[img]
Preview
Text
nasafm11_front.pdf

Download (481Kb)

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.

Item Type: Proceedings Paper
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.
Keywords: dependent types, automated theorem prover, agda, proof assistant
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Dr Simon Foster
Date Deposited: 27 Oct 2011 09:25
Last Modified: 15 Sep 2014 03:51
Published Version: http://dx.doi.org/10.1007/978-3-642-20398-5_10
Status: Published
Publisher: Springer
Refereed: Yes
Identification Number: 10.1007/978-3-642-20398-5_10
URI: http://eprints.whiterose.ac.uk/id/eprint/43344

Actions (repository staff only: login required)