RECURSIVE TYPE

Domain	Definition
Computing	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: data Good = Pair Int Good data Fine = Fun (Bool->Fine). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Anagrams: RECURSIVE TYPE

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "c-e-e-e-i-p-r-r-s-t-u-v-y"
	-2 letters: persecutive.
	-3 letters: perceivers, perversity, preservice, respective.
	-4 letters: creepiest, eruptives, perceiver, perceives, persecute, precieuse, preerects, receivers, receptive, recursive, reprieves, reservice, respecter, retrieves, scripture, secretive, supercity.
	-5 letters: cerusite, creepers, creepier, creepies, crepiest, crustier, cuprites, curviest, cutesier, epicures, erecters, erective, eruptive, eucrites, evictees, perceive, perverse, perverts, pesterer, pictures, piecrust, piercers, preciser, precures, preerect, preserve, receipts, receiver, receives.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.