http://conal.net/blog/posts/a-type-for-partial-values Inspirations & experiments, mainly about denotative/functional programming in Haskell Sat, 26 Sep 2020 21:06:12 +0000 hourly 1 http://wordpress.org/?v=4.1.17 http://conal.net/blog/posts/a-type-for-partial-values#comment-110 Sat, 22 Nov 2008 23:19:59 +0000 http://conal.net/blog/posts/a-type-for-partial-values/#comment-110 […] a simple representation for partial information about values, and wrote about it in two posts, A type for partial values and Implementing a type for partial values. Of particular interest is the ability to combine two […]

]]> http://conal.net/blog/posts/a-type-for-partial-values#comment-109 Thu, 17 Apr 2008 21:47:17 +0000 http://conal.net/blog/posts/a-type-for-partial-values/#comment-109 […] « A type for partial values "Tangible Functional Programming" — icfp version […]

]]> http://conal.net/blog/posts/a-type-for-partial-values#comment-108 Mon, 02 Jul 2007 13:53:00 +0000 http://conal.net/blog/posts/a-type-for-partial-values/#comment-108 The second argument wins. mappend doesn’t care whether information gets lost from the first argument, so it doesn’t have to check for conflicts. That’s how mappend disagrees with lub, and in this sense, perhaps my Partial is less than ideal.

]]> http://conal.net/blog/posts/a-type-for-partial-values#comment-107 Mon, 02 Jul 2007 08:50:00 +0000 http://conal.net/blog/posts/a-type-for-partial-values/#comment-107 What does mappend do when given two arguments with conflicting information? What does it do when given equal information? And how does it know that they are equal?

]]>