Abstract
By encapsulating the primitive rules of inference as the constructors of the abstract type of theorems, LCF-style systems provide a successful answer to the problem of how to soundly add derived inference rules to a theorem prover. We suggest a supplementary method which uses formal proof of program equivalence to justify the dynamic addition of new primitive rules. The method does not increase the strength of the logic; rather, it is a means of increasing the computational strength of the implementation. The method can be used to enforce rigour in the process of iteratively improving the performance of a system. This work uses first class environments, a recent addition to the SML/NJ compiler.
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 callMore From: Higher Order Logic Theorem Proving and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
