Higher-Order and Symbolic Computation

, Volume 19, Issue 2–3, pp 169–195 | Cite as

Mechanising λ-calculus using a classical first order theory of terms with permutations

  • Michael NorrishEmail author


This paper describes the mechanisation in HOL of some basic λ-calculus theory. The proofs are taken from standard sources (books by Hankin and Barendregt), and cover: equational theory, reduction theory, residuals, finiteness of developments, and the standardisation theorem. The issues in mechanising pen-and-paper proofs are discussed; in particular, those difficulties arising from the sources’ use of the Barendregt Variable Convention.


Rule Induction High Order Logic Structural Induction Induction Principle Lambda Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ambler, S.J., Crole, R.L., Momigliano, A.: Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.), Theorem Proving in Higher Order Logics, 15th International Conference, vol. 2410 of Lecture Notes in Computer Science, pp. 13–30 (2002)Google Scholar
  2. 2.
    Barendregt, H.P.: The Lambda Calculus: its Syntax and Semantics, vol. 103 of Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam: revised edition (1984)Google Scholar
  3. 3.
    Ford, J.M., Mason, I.A.: Operational Techniques in PVS: A Preliminary Evaluation. In: Fidge, C. (ed.), Computing: The Australasian Theory Symposium (CATS 2001), vol.42 of Electronic Notes in Theoretical Computer Science (2001)Google Scholar
  4. 4.
    Gordon, A.D.: A Mechanisation of Name-Carrying Syntax up to Alpha-Conversion. In: Joyce, J.J., Seger, C.J.H. (eds.), In: Proceedings of Higher-Order Logic Theorem Proving and its Applications (HUG’93), vol. 780 of Lecture Notes in Computer Science, pp. 413–425 (1994)Google Scholar
  5. 5.
    Gordon, A.D., Melham, T.: Five Axioms of Alpha Conversion. In: von Wright, J., Grundy, J., Harrison, J. (eds.), Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs’96, vol. 1125 of Lecture Notes in Computer Science, pp. 173–190 (1996)Google Scholar
  6. 6.
    Hankin, C.: Lambda Calculi: A Guide for Computer Scientists, vol.3 of Graduate Texts in Computer Science, Clarendon Press, Oxford (1994)Google Scholar
  7. 7.
    Homeier, P.: A Proof of the Church-Rosser Theorem for the Lambda Calculus in Higher Order Logic. In: Boulton, R.J., Jackson, P.B. (eds.), TPHOLs 2001: Supplemental Proceedings. Available as Informatics Research Report EDI-INF-RR-0046 pp. 207–222 (2001)Google Scholar
  8. 8.
    Homeier, P.: A Design Structure for Higher Order Quotients in tphols2005, pp.130–146 (2005)Google Scholar
  9. 9.
    Huet, G.P.: Residual Theory in Lambda-Calculus: A Formal Development. Journal of Functional Programming 4(3), 371–394 (1994)zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Hurd, J., Melham, T. (eds.): Theorem Proving in Higher Order Logics 18th International Conference, Lecture Notes in Computer Science, Springer, vol.3603 (2005)Google Scholar
  11. 11.
    McKinna, J., Pollack, R.: Some Lambda Calculus and Type Theory Formalized. Journal of Automated Reasoning 23(3–4), 373–409 (1999)zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Norrish, M.: Mechanising Hankin and Barendregt Using the Gordon-Melham Axioms. In: Honsell, F., Miculan, M., Momigliano, A. (eds.), Merlin 2003, Proceedings of the Second ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding. Available at (2003)
  13. 13.
    Norrish, M.: Recursive Function Definition for Types with Binders. In: Slind, K., Bunker, A., Gopalakrishnan, G. (eds.) Theorem Proving in Higher Order Logics, 17th International Conference, vol. 3223 of LNCS. pp. 241–256 (2004)Google Scholar
  14. 14.
    Paulson, L.: Defining Functions on Equivalence Classes. ACM Transactions on Computational Logic. To appear.Google Scholar
  15. 15.
    Pitts, A.M.: Nominal Logic, A First Order Theory of Names and Binding. Information and Computation 186, 165–193 (2003)zbMATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    Pitts, A.M.: Alpha-Structural Recursion and Induction (Extended Abstract) in phols2005, pp.17–34 (2005)Google Scholar
  17. 17.
    Urban, C., Tasson, C.: Nominal Techniques in Isabelle/HOL. In: Nieuwenhuis, R. (ed.), Proceedings of the 20th International Conference on Automated Deduction (CADE), vol. 3632 of Lecture Notes in Computer Science, pp. 38–53 (2005)Google Scholar
  18. 18.
    Vestergaard, R.: The Primitive Proof Theory of the λ-Calculus. Ph.D. thesis, School of Mathematical and Computer Sciences, Heriot-Watt University (2003)Google Scholar
  19. 19.
    Vestergaard, R., Brotherston, J.: A Formalised First-Order Confluence Proof for the λ-Calculus using One-Sorted Variable Names (Barendregt was right after all almost). In: Middeldorp, A. (ed.), Proceedings of RTA-12, vol. 2051 of LNCS (2001a)Google Scholar
  20. 20.
    Vestergaard, R., Brotherston, J.: The Mechanisation of Barendregt-Style Equational Proofs (The Residual Perspective). Electronic Notes in Theoretical Computer Science 58(1) (2001b)Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Canberra Research Laboratory, National ICT Australia, Research School of Information Science and EngineeringAustralian National UniversityAustralia

Personalised recommendations