Erdős–Szekeres theorem with forbidden order types

According to the classical Erdős–Szekeres theorem, every sufficiently large set of points in general position in the plane contains a large subset in convex position. Parallel to the Erdős–Hajnal problem in graph-Ramsey theory, we investigate how large such subsets must a configuration contain if it does not have any sub-configuration belonging to a fixed order type.