Logic for Computable Functions: Difference between revisions

Revision as of 16:29, 1 June 2022

Revision as of 16:18, 2 June 2022

Line 19:

Theorem proving often benefits from decision procedures and theorem proving algorithms, whose correctness has been extensively analyzed. A straightforward way of implementing these procedures in an LCF approach requires such procedures to always derive outcomes from the axioms, lemmas, and inference rules of the system, as opposed to directly computing the outcome. A potentially more efficient approach is to use reflection to prove that a function operating on formulas always gives correct result.

<ref>{{cite report |last1=Boyer |first1=Robert S |last2=Moore |first2=J Strother |title=Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures |publisher=Technical Report CSL-108, SRI Projects 8527/4079 |pages=1-111 |url=https://apps.dtic.mil/dtic/tr/fulltext/u2/a094385.pdf |archive-url=https://web.archive.org/web/20191102152631/https://apps.dtic.mil/dtic/tr/fulltext/u2/a094385.pdf |url-status=deadlive |archive-date=November 2, 2019 |access-date=2 November 2019}}</ref>

== Influences ==