Prufrock: a framework for constructing polytypic theorem provers

Authors:
Justin Ward;Garrin Kimmell;Perry Alexander
Affiliations:
ITTC, University of Kansas, Lawrence, KS;ITTC, University of Kansas, Lawrence, KS;ITTC, University of Kansas, Lawrence, KS
Venue:
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Year:
2005

Citing 5
Cited 0

ML for the working programmer (2nd ed.)

ML for the working programmer (2nd ed.)
PolyP—a polytypic programming language extension

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The TPTP Problem Library

Journal of Automated Reasoning
Polytypic Programming

Advanced Functional Programming, Second International School-Tutorial Text
Polytypic unification

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in the verification of specified properties. Unfortunately, the implementation of each such tool requires an early commitment to a particular methodology and language, in terms of both high-level semantic concerns and the lower-level syntactic representations of properties and proofs. In this paper, we present Prufrock, a novel approach to automated reasoning systems, which abstracts semantic concerns over entire classes of potential implementation languages. Prufrock utilizes polytypic programming techniques to create independent, reusable modules defining proof in different logics, independent of the language used to represent formulae in the logic, as well as the exact implementation of low-level prover functionality.