Abstract
Operational Type The ory (OpTT ) can be used to construct and check proofs related to programs, but the development of these proofs can be somewhat tedious. An algorithm is presented that can be used to automatically generate proofs of equality in OpTT . The al gorithm takes as input a set of ground equations and two terms that should be tested for joinability modulo the supplied ground equations. The al gorithm will equate the terms if and only if there exists an OpTT pr oof that can equate the two terms using only the proof rules related to evaluation under the operational semantics, symmetry, transitivity, and congruence with respect to the supplied ground equations. The de scription of this algorithm is accompanied by a proof that the algorithm is partially correct.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
