%0 Journal Article 
%F brhe98
%A Brandt, Michael
%A Henglein, Fritz
%T Coinductive axiomatization of recursive type equality and subtyping
%J Fundamenta Informaticae
%V 33
%N 4
%P 309-338
%X We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by coinductive characterizations of type containment and type equality via simulation and bisimulation, respectively. The main novelty of the axiomatization is the fixpoint rule, a finitary coinduction principle. The new axiomatizations give rise to a natural operational interpretation of proofs as coercions and to efficient algorithms for constructing explicit coercions efficiently, not only deciding type equality and type containment. More generally, we show how adding the fixpoint rule makes it possible to define inductively a a set coinductively defined as the kernel (greatest fixed point) of an inference system
%U http://www.diku.dk/hjemmesider/ansatte/henglein/papers/brandt1998.pdf
%D 1998
%K rectype
%K  coinduction
%K  coinduction