I find it a little easier to decide what the Applicative instance "should" do by starting with pair :: f a -> f b -> f (a, b) from which you can derive the rest using pure and fmap
I think the idea is that something is ambiguous if it has more than one meaning. This language avoids the problem by having no meaning. It may be a very dry joke. I'm not sure.
They suggested naïve sequential string replacing for html templating, so I would absolutely expect a bunch of regular expressions.
I find it a little easier to decide what the Applicative instance "should" do by starting with pair :: f a -> f b -> f (a, b) from which you can derive the rest using pure and fmap
I think the idea is that something is ambiguous if it has more than one meaning. This language avoids the problem by having no meaning. It may be a very dry joke. I'm not sure.
They suggested naïve sequential string replacing for html templating, so I would absolutely expect a bunch of regular expressions.