Integrating an automated theorem prover into agda

Authors:
Simon Foster;Georg Struth
Affiliations:
Department of Computer Science, University of Sheffield, UK;Department of Computer Science, University of Sheffield, UK
Venue:
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Year:
2011

Citing 13
Cited 3

Algebra of programming

Algebra of programming
WALDMEISTER - High-Performance Equational Deduction

Journal of Automated Reasoning
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
The view from the left

Journal of Functional Programming
Algebra of Programming Using Dependent Types

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
A Brief Overview of Agda --- A Functional Language with Dependent Types

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Dependently-typed formalisation of relation-algebraic abstractions

RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Connecting a logical framework to a first-order logic prover

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
A tool for automated theorem proving in agda

TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Sledgehammer: judgement day

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Nitpick: a counterexample generator for higher-order logic based on a relational model finder

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Fast LCF-Style proof reconstruction for z3

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving

Automatic proof and disproof in Isabelle/HOL

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Dependently typed programming based on automated theorem proving

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Correctness of object oriented models by extended type inference

ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

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.