Comments on: Implementing a type for partial values
http://conal.net/blog/posts/implementing-a-type-for-partial-values
Inspirations & experiments, mainly about denotative/functional programming in HaskellSat, 26 Sep 2020 21:06:12 +0000hourly1http://wordpress.org/?v=4.1.17By: Conal Elliott » Blog Archive » Merging partial values
http://conal.net/blog/posts/implementing-a-type-for-partial-values#comment-112
Sat, 22 Nov 2008 23:20:20 +0000http://conal.net/blog/posts/implementing-a-type-for-partial-values/#comment-112[…] 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 partial values into one, combining the […]
]]>By: Michael Karcher
http://conal.net/blog/posts/implementing-a-type-for-partial-values#comment-111
Sat, 05 Jan 2008 16:30:00 +0000http://conal.net/blog/posts/implementing-a-type-for-partial-values/#comment-111My first attempt on trying to implement partial values was

type Partial a = [a->a]

After reading the beginning of your solution post, it was obvious that putting the functions first into a list to fold it later is unneeded. Then I first wrote my own “Endo” instance, and got it to work too. When refactoring the code to the presented version, I noted, that with the “Endo” Monoid instance, mappend show exactly the opposite behaviour than the requested one: The left argument replaces info from the right one, and not vice versa.
]]>