2005 | OriginalPaper | Buchkapitel
Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
verfasst von : Michael Norrish, Konrad Slind
Erschienen in: Theorem Proving in Higher Order Logics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We discuss methods for dealing effectively with
let
-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translation from the
λ
-calculus to combinators. This approach copes with the usual
HOL
encodings of paired abstraction, ensures that bound variable names are preserved, and uses only conventional simplification technology.