Michael Norrish

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Scott Owens

> Home > Persons > Michael Norrish

Publications

2019
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/jfp/TanMKFON19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jfp/TanMKFON19
Yong Kiam Tan, Magnus O. Myreen, Ramana Kumar, Anthony C. J. Fox, Scott Owens, Michael Norrish:
The verified CakeML compiler backend. J. Funct. Program. 29: e2 (2019)
2017
[j9]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/pacmpl/OwensNKMT17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pacmpl/OwensNKMT17
Scott Owens, Michael Norrish, Ramana Kumar, Magnus O. Myreen, Yong Kiam Tan:
Verifying efficient function calls in CakeML. Proc. ACM Program. Lang. 1(ICFP): 18:1-18:27 (2017)
2016
[c37]
- view
  authority control:
- export record
  dblp key:
  - conf/icfp/TanMKFON16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icfp/TanMKFON16
Yong Kiam Tan, Magnus O. Myreen, Ramana Kumar, Anthony C. J. Fox, Scott Owens, Michael Norrish:
A new verified compiler backend for CakeML. ICFP 2016: 60-73
2014
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/popl/KumarMNO14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/popl/KumarMNO14
Ramana Kumar, Magnus O. Myreen, Michael Norrish, Scott Owens:
CakeML: a verified implementation of ML. POPL 2014: 179-192

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.