Difference between revisions of "Talk:Peano numbers"

From HaskellWiki
Jump to navigation Jump to search
m
(thinking about a better way to say it)
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 more like co-inductive types. In particular, ''infinity'' is ''allowed'' as ''infinite lists'' are ''allowed''. (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]] 21:34, 29 May 2011 (UTC)
 

Revision as of 01:03, 30 May 2011