recursive type

A data type which contains itself. The commonest example isthe 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 anotherlist (the "tail").

Recursion is not allowed in Miranda or Haskell synonym types, so the following Haskell types are illegal:

type Bad = (Int, Bad)type Evil = Bool -> Evil

whereas the seeminly equivalent algebraic data types areacceptable:

data Good = Pair Int Gooddata Fine = Fun (Bool->Fine)

单词	recursive type
释义	recursive type recursive type A data type which contains itself. The commonest example isthe 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 anotherlist (the "tail"). Recursion is not allowed in Miranda or Haskell synonym types, so the following Haskell types are illegal: type Bad = (Int, Bad)type Evil = Bool -> Evil whereas the seeminly equivalent algebraic data types areacceptable: data Good = Pair Int Gooddata Fine = Fun (Bool->Fine)
随便看	your business on the internet your business partner your business tax kit your butter and egg money your butt is on the line your bête noire your cake is dough your call your call is important to us your catholic voice foundation yourcenar yourcenar, marguerite your character here your check is in the mail your claws are showing your claws were showing your concept car your conscience is clean your conscience is clear your considered opinion your crowning glory your cup of tea your cup runneth over your curiosity has just cost you a quarter for the juke box your curiosity just cost you a dollar for the juke box