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 mon

First Page		Document Content
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 mon Add to Reading List Source URL: personal.cis.strath.ac.uk Download Document from Source Website File Size: 274,75 KB Share Document on Facebook