The congruence tactic built into the Coq proof management system allows for solving entailment of closed equalities with uninterpreted function symbols. In this project we build a congruence tactic that works with multiple relations. My theoretical contribution is to describe a translation from entailments in a generalized form of congruence into the traditional form that existing algorithms can solve. The tactic makes use of this transformation, as well as an implementation of congruence closure, to solve Coq goals involving multiple relations.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Ehrlich, Kyle

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-050521-204339
• 22476

Advisor

• Dougherty, Daniel J.

Year

• 2021

Date created

• 2021-05-05

Resource type

• Major Qualifying Project

Major

• Computer Science

Rights statement

• In Copyright