Skip to main content
SpringerLink
Log in

Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof

  • Conference paper
Theorem Proving in Higher Order Logics (TPHOLs 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3603))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Broda, S., Damas, L.: Compact bracket abstraction in combinatory logic. Journal of Symbolic Logic 62(3), 729–740 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Curry, H.B., Feys, R.: Combinatory Logic, vol. 1. North-Holland, Amsterdam (1958) Two sections by William Craig

    MATH  Google Scholar 

  3. Diller, A.: Efficient mult-variate abstraction using an array representation for combinators. Information Processing Letters 84(6), 311–317 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hindley, J.R., Seldin, J.P.: Introduction to Combinators and λ-Calculus. London Mathematical Society Student Texts, vol. 1. Cambridge University Press, Cambridge (1986)

    Google Scholar 

  5. Nipkow, T.: Functional unification of higher order patterns. In: Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, pp. 64–74. IEEE Computer Society Press, Los Alamitos (1993)

    Chapter  Google Scholar 

  6. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL— A Proof Assistant for Higher-Order Logic, vol. 2283. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  7. Turner, D.A.: Another algorithm for bracket abstraction. Journal of Symbolic Logic 44(2), 257–270 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National ICT, Australia

    Michael Norrish

  2. School of Computing, University of Utah,  

    Konrad Slind

Authors
  1. Michael Norrish
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konrad Slind
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Laboratory, Oxford University,  

    Joe Hurd

  2. Computing Laboratory, Oxford University, Wolfson Building, Parks Road Oxford, OX1 3QD, UK

    Tom Melham

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Norrish, M., Slind, K. (2005). Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof. In: Hurd, J., Melham, T. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2005. Lecture Notes in Computer Science, vol 3603. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11541868_26

Download citation

  • DOI: https://doi.org/10.1007/11541868_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28372-0

  • Online ISBN: 978-3-540-31820-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation