Proof pearl: using combinators to manipulate let-expressions in proof

Authors:
Michael Norrish;Konrad Slind
Affiliations:
National ICT, Australia;School of Computing, University of Utah
Venue:
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Year:
2005

Citing 3
Cited 0

Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
Efficient multi-variate abstraction using an array representation for combinators

Information Processing Letters
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.