0%

recursive type

R r

Transcription

    • US Pronunciation
    • US IPA
    • US Pronunciation
    • US IPA

Definition of recursive type words

  • noun Technical meaning of recursive type 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 types, so the following Haskell types are illegal: type Bad = (Int, Bad) type Evil = Bool -> Evil whereas the seeminly equivalent algebraic data types are acceptable: 1
Just one definition for recursive type

Information block about the term

Parts of speech for Recursive type

noun
adjective
verb
adverb
pronoun
preposition
conjunction
determiner
exclamation
Full grammatical hierarchy of Recursive type

See also

Matching words

Was this page helpful?
Yes No
Thank you for your feedback! Tell your friends about this page
Tell us why?