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

Citation

Norrish, M 2006, 'Mechanising lambda-calculus using a classical first order theory of terms with permutations', Higher-Order and Symbolic Computation, vol. 19, no. 2-3, pp. 169-195.

Year

2006

ANU Authors

Fields of Research

  • Computational Logic And Formal Languages
  • Computation Theory And Mathematics Not Elsewhere Classified

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