[Haskell-cafe] Haskell is a declarative language? Let's see how easy it is to declare types of things.

[Tom Ellis]

On Thu, Apr 04, 2013 at 01:15:27PM +0000, Johannes Waldmann wrote:
> Tom Ellis <tom-lists-haskell-cafe-2013 <at> jaguarpaw.co.uk> writes:
> > I didn't see an example of quantifiers in the wrong place. 
> 
> The example was:
> 
> >  every x satisfies P(x,y) for some y

Oh I see.  I interpreted that as lack of disambiguating parentheses, but
it's not unreasonable to assert that quantifiers should always come before
formulas.

Syntax certainly is hard.  I remember being completely puzzled the first
time I saw

/
| dx (long expression in x)
/

when I expected

/
| (long expression in x) dx
/

(Those are integral signs, by the way!)

Tom