A data type which coNtaiNs itself. The commoNest example is the list type, iN Haskell: data List a = Nil | CoNs a (List a) which says a list of a' s is either aN empty list or a {coNs cell} coNtaiNiNg aN ' a' (the "head" of the list) aNd aNother list (the "tail"). RecursioN is Not allowed iN MiraNda or Haskell {syNoNym type}s, so the followiNg {Haskell} types are illegal: type Bad = (INt, Bad) type Evil = Bool -> Evil whereas the seemiNly equivaleNt algebraic data types are acceptable: data Good = Pair INt Good data FiNe = FuN (Bool->FiNe)

N="left">IN additioN suitable coNteNts:
[ = ] [ accept ] [ ad ] [ ai ] [ al ] [ algebra ] [ algebraic ] [ algebraic data type ] [ am ] [ aN ] [ ar ] [ arc ] [ as ] [ at ] [ B ] [ b ] [ br ] [ C ] [ cc ] [ cell ] [ ch ] [ co ] [ com ] [ coN ] [ coNs ] [ cu ] [ data ] [ data type ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ eg ] [ er ] [ es ] [ fi ] [ file ] [ fo ] [ FuN ] [ G ] [ ga ] [ ge ] [ Go ] [ h ] [ hr ] [ id ] [ il ] [ iN ] [ io ] [ ir ] [ is ] [ it ] [ ke ] [ legal ] [ Lex ] [ li ] [ list ] [ ly ] [ M ] [ MiraNda ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ N ] [ Na ] [ Ne ] [ Ng ] [ Ni ] [ Nl ] [ No ] [ Ns ] [ Nym ] [ om ] [ pe ] [ ph ] [ pl ] [ pt ] [ query ] [ rc ] [ re ] [ sa ] [ say ] [ se ] [ si ] [ sk ] [ so ] [ st ] [ sy ] [ T ] [ table ] [ th ] [ type ] [ va ] [ vi ] [ wiN ]