A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Positive Inductive-Recursive Definitions
[chapter]
2013
Lecture Notes in Computer Science
We introduce a new theory of data types which allows for the definition of data types as initial algebras of certain functors Fam C → Fam C. This theory, which we call positive inductive-recursive definitions, is a generalisation of Dybjer and Setzer's theory of inductive-recursive definitions within which C had to be discrete -our work can therefore be seen as lifting this restriction. This is a substantial endeavour as we need to not only introduce a type of codes for such data types (as in
doi:10.1007/978-3-642-40206-7_3
fatcat:bmbq64zvbzdzjaj45xl5fyfbje