[PRL] point-free set notation

[David Herman]

In Haskell, you can curry a binary operator to define a function  
without naming the missing argument:

     (+n) === \m -> (m+n)

Is there an analogous notation in math for constructing a set based on  
a binary relation with an omitted element? For example, I'd like to be  
able to define the set of integers > n like:

     { -- > n } === { m | m > n }

or something like that. (I'm aware that generally this is a type- 
ambiguous notation, but for my purposes the meta-variables involved  
are enough to disambiguate.)

Thanks,
Dave