features and flaws

Reading the doc about it, what I don’t like is Haskell parsing

f(a,b) = f a b

How to parse

f a b c

with f:AxB->C->D , a:A, b:B, c:C

f(a,b)(c) would be correct, but f(a,b,c) looks intuitive

Explicit is better than implicit.

BNF-Grammar parser. python LR1-parser is a reasonable restriction to lang complexitiy but, better syntax error displaying parsers are necessary.

Einen besseren Parser schreiben. Eine bessere Syntax verwenden.