Morris, Peter and Altenkirch, Thorsten and Ghani, Neil (2009) A universe of strictly positive families. International Journal of Foundations of Computer Science, 20 (1). pp. 83-107. ISSN 0129-0541Full text not available in this repository. (Request a copy from the Strathclyde author)
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them as inductive families. Strictly positive types (SPTs) form a grammar for defining inductive types and, consequently, a fundamental question in the the theory of inductive families is what constitutes a corresponding grammar for inductive families. This paper answers this question in the form of strictly positive families or SPFs. We show that these SPFs can be used to represent and compute with a variety of advanced data types and that generic programs can naturally be written over the universe of SPFs.
|Keywords:||inductive families , data types, programming, Electronic computers. Computer science, Computer Science (miscellaneous)|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||18 Oct 2011 13:52|
|Last modified:||04 May 2016 19:42|