Difference between revisions of "Talk:Peano numbers"

From HaskellWiki
Jump to navigation Jump to search
(These numbers are actually co-inductive types.)
 
(comments rewritten)
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
Theoretically speaking, the numbers defined here are not Peano numbers. As far as I know it is difficult, if not impossible, to define inductive types in Haskell. The numbers here are co-inductive. In particular, 'infinity' is allowed as infinite lists are allowed. People who are looking for formal, theoretical foundation should take this Wiki page with a pinch of salt. --[[User:Favonia|Favonia]] 21:34, 29 May 2011 (UTC)
+
Theoretically speaking, the numbers defined here are not Peano numbers. As far as I know it is difficult, if not impossible, to define such inductive types in Haskell. In particular, ''infinity'' is included in this type (as ''infinite lists'' are included in the list type). (Sorry for my imprecise languages here.) People who are looking for formal, theoretical foundation should take this Wiki page with a pinch of salt. --[[User:Favonia|Favonia]] 02:27, 30 May 2011 (UTC)

Latest revision as of 02:27, 30 May 2011

Theoretically speaking, the numbers defined here are not Peano numbers. As far as I know it is difficult, if not impossible, to define such inductive types in Haskell. In particular, infinity is included in this type (as infinite lists are included in the list type). (Sorry for my imprecise languages here.) People who are looking for formal, theoretical foundation should take this Wiki page with a pinch of salt. --Favonia 02:27, 30 May 2011 (UTC)