This paper introduces polymorphic extractors, a technique for tackling two main issues with the existing pattern matching implemented in functional languages. First, this technique defines semantical pattern matching rather than a syntactical one. Second, this technique solves the portability issue when defining a set of patterns based on different underlying data-structure design choices. Furthermore, polymorphic extractors can be further improved by performing optimisations and multi-stage programming on them. The key technique behind polymorphic extractors is using the tagless-final technique (a.k.a. polymorphic embedding/object algebra) for defining different views or extractors over expression terms.