Object-Oriented Theorem Proving (OOTP): First Thoughts

by   Moez A. AbdelGawad, et al.
Rice University

Automatic (i.e., computer-assisted) theorem proving (ATP) can come in many flavors. This document presents early steps in our effort towards defining object-oriented theorem proving (OOTP) as a new style of ATP. Traditional theorem proving (TTP) is the only well-known flavor of ATP so far. OOTP is a generalization of TTP. While TTP is strongly based on functional programming (FP), OOTP is strongly based on object-oriented programming (OOP) instead. We believe OOTP is a style of theorem proving that is no less powerful and no less natural than TTP and thus likely will be no less practically useful than TTP. In the document we also discuss, very briefly, a related notion of OO software verification (OOSV) based on OOTP. To clarify the relation between OOTP and TTP, we also touch on the relation between OOP and FP.


page 1

page 2

page 3

page 4


Subsumption Demodulation in First-Order Theorem Proving

Motivated by applications of first-order theorem proving to software ana...

Evidence Algorithm and System for Automated Deduction: A Retrospective View

A research project aimed at the development of an automated theorem prov...

INT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving

In learning-assisted theorem proving, one of the most critical challenge...

How do humans succeed in tasks like proving Fermat's Theorem or predicting the Higgs boson?

I discuss issues of inverting feasibly computable functions, optimal dis...

Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture

There are several approaches for using computers in deriving mathematica...

Formalising Filesystems in the ACL2 Theorem Prover: an Application to FAT32

In this work, we present an approach towards constructing executable spe...

Please sign up or login with your details

Forgot password? Click here to reset