3. Someone could write
pattern P x <- ... where
P :: ...
P x = ...
The pattern signature has to be the same as the constructor signature except for constraints, so it doesn't necessarily sound trivial to infer.
-------- Original message --------
From: Simon Peyton Jones <simonpj@microsoft.com>
Date: 1/15/18 6:36 PM (GMT-05:00)
To: David Feuer <david@well-typed.com>
Cc: ghc-devs@haskell.org
Subject: RE: Implementing pattern synonym constructor signatures
0. Parsing. I wasn't actually able to find the code that parses pattern synonyms. Can someone point me in the right direction?