![](https://www.pdfsearch.io/img/bc65910893e8449a9a8698e9f89bb645.jpg) Date: 2015-02-14 16:21:41
| | Totality versus Turing-Completeness? Conor McBride University of Strathclyde Abstract. In this literate Agda paper, I show that general recursive definitions can be represented in the free monAdd to Reading ListSource URL: personal.cis.strath.ac.ukDownload Document from Source Website File Size: 274,75 KBShare Document on Facebook
|