  We propose an amortized analysis that approximates the resource usage of a
Haskell expression. Using the plugin API of GHC, we convert the Haskell code
into a simplified representation called GHC Core. We then apply a type-based
system which derives linear upper bounds on the resource usage. This setup
allows us to analyze actual Haskell code, whereas previous implementations of
similar analyses do not support any commonly used lazy functional programming
languages.
