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

Citation

Norrish, M & Slind, K 2005, 'Proof pearl: using combinators to manipulate let-expressions in proof', in Joe Hurd, Tom Helham (ed.), Theorem Proving in Higher Order Logics: 18th international conference TPHOLs 2005, Oxford 2005, proceedings, Springer, United Kingdom, pp. 397-408.

Year

2005

ANU Authors

Field of Research

  • Computational Logic And Formal Languages

Updated:  15 April 2021 / Responsible Officer:  Director (Research Services Division) / Page Contact:  Researchers