Michael Norrish

View Scopus Profile

Dr Michael Norrish

Associate Professor

 https://orcid.org/0000-0003-1163-8467
Calculated based on number of publications stored in Pure and citations from Scopus
Calculated based on number of publications stored in Pure and citations from Scopus
Calculated based on number of publications stored in Pure and citations from Scopus
20042024

Research activity per year

  • 36 Conference contribution
  • 16 Article
  • 2 Chapter
  • 1 Conference article
Filter
Chapter

Search results

  • 2005

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

    Norrish, M. & Slind, K., 2005, Theorem Proving in Higher Order Logics: 18th international conference TPHOLs 2005, Oxford 2005, proceedings. J. H. T. H. (ed.). 1st ed. United Kingdom: Springer, Vol. 1. p. 397-408

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

  • 2004

    Recursive Function Definition for Types with Binders

    Norrish, M., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Slind, K., Gopalakrishnan, G. & Bunker, A. (eds.). Springer Verlag, p. 241-256 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3223).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

    23 Citations (Scopus)