| slovo | definícia |
recursive type
(foldoc) | 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)
|
| |
Nenašli ste slovo čo ste hľadali ? Doplňte ho do slovníka.
na vytvorenie tejto webstránky bol pužitý dictd server s dátami z sk-spell.sk.cx a z iných voľne dostupných dictd databáz. Ak máte klienta na dictd protokol (napríklad kdict), použite zdroj slovnik.iz.sk a port 2628.
online slovník, sk-spell - slovníkové dáta, IZ Bratislava, Malé Karpaty - turistika, Michal Páleník, správy, údaje o okresoch V4