Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
International Journal of Foundations of Computer Science c World Scientific Publishing Company
 

Summary: International Journal of Foundations of Computer Science
c World Scientific Publishing Company
A Universe of Strictly Positive Families
PETER MORRIS
and
THORSTEN ALTENKIRCH
and
NEIL GHANI
School of Computer Science and IT
Jubilee Campus, Wollaton Road
Nottingham, NG8 1BB, UK
Received (received date)
Revised (revised date)
Communicated by Editor's name
ABSTRACT
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.

  

Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham
Ghani, Neil - Department of Computer and Information Sciences, University of Strathclyde

 

Collections: Computer Technologies and Information Sciences