The concept of Bottom in Haskell

人盡茶涼 提交于 2019-11-27 00:58:45

问题


Bottom in Haskell described here is said to be any computation that have errors, is unterminated, or involves infinite loop, is of any type... is this specific to Haskell? We know in Lattice theory, there is also a notion of Bottom there.....and shouldn't Bottom be defined based on what's the order defined?


回答1:


Indeed there is an order of definedness, where bottom is the least defined value. Have a look at this page about denotational semantics in Haskell for a more thorough explanation.

Here is a lattice for the values of Maybe Bool taken from the wiki page. It shows that Just True is more defined than Just ⊥ which is more defined than .



来源:https://stackoverflow.com/questions/6379458/the-concept-of-bottom-in-haskell

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!