	Словари, Словарь Dictionary
	Словари, Словарь Dictionary Online computer dictionary - Свободный компьютерный английский словарь О сайте 10 самых Словари Обратная связь

! & ( * , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = @ %
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ { ~

R2 R3 R4 R: RA RB RC RD RE RF RG RH RI RJ RK RL RM RN RO RP RR RS RT RU RW RX RÉ

recursive type

recursive type A data type which contains itself. The commonest example is the list type, in : data List a = Nil | Cons a (List a) which says a list of a's is either an empty list or a containing an 'a' (the "head" of the list) and another list (the "tail"). Recursion is not allowed in or Haskell s, so the following types are illegal: type Bad = (Int, Bad) type Evil = Bool -> Evil whereas the seeminly equivalent s are acceptable: data Good = Pair Int Good data Fine = Fun (Bool->Fine)

на заглавную

О сайте • 10 самых • Словари • Обратная связь

к началу страницы

XHTML | CSS

1.8.11