Object-Oriented Theorem Proving (OOTP): First Thoughts
Moez A. AbdelGawad

TL;DR
This paper introduces object-oriented theorem proving (OOTP), a new style of automated theorem proving based on object-oriented programming, aiming to be as powerful and natural as traditional functional-based methods.
Contribution
It proposes OOTP as a novel generalization of traditional theorem proving, shifting from functional to object-oriented paradigms.
Findings
OOTP is a promising new style of ATP.
OOTP is as powerful as traditional theorem proving.
OOTP leverages object-oriented programming principles.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Parallel Computing and Optimization Techniques · Formal Methods in Verification
