\title{Bounded Natural Functors with Covariance and Contravariance} \author{Andreas Lochbihler and Joshua Schneider} \maketitle
\begin{abstract}
Bounded natural functors (BNFs) provide a modular framework for the construction of (co)datatypes in higher-order logic.
Their functorial operations, the mapper and relator, are restricted to a subset of the parameters, namely those where recursion can take place.
For certain applications, such as free theorems, data refinement, quotients, and generalised rewriting, it is desirable that these operations do not ignore the other parameters.
In this article, we formalise the generalisation \BNFCC{}~\cite{LochbihlerSchneider2018ITP} that extends the mapper and relator to covariant and contravariant parameters.
We show that
(i)~\BNFCC{}s are closed under functor composition and least and greatest fixpoints,
(ii)~subtypes inherit the \BNFCC{} structure under conditions that generalise those for the BNF case, and
(iii)~\BNFCC{}s preserve quotients under mild conditions.
These proofs are carried out for abstract\BNFCC{}s similar to the AFP entry BNF Operations \cite{BNF_Operations-AFP}.
In addition, we apply the \BNFCC{} theory to several concrete functors. \end{abstract}
For an informal description of the abstract proofs see \cite{LochbihlerSchneider2018ITP}.
\clearpage
\tableofcontents
\clearpage
% sane default for proof documents \parindent0pt\parskip0.5ex
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.