Conditioning information in mutual fund performance evaluation: Portuguese evidence

We estimate and compare the performance of Portuguese-based mutual funds that invest in the domestic market and in the European market using unconditional and conditional models of performance evaluation. Besides applying both partial and full conditional models, we use European information variables, instead of the most common local ones, and consider stochastically detrended conditional variables in order to avoid spurious regressions. The results suggest that mutual fund managers are not able to outperform the market, presenting negative or neutral performance. The incorporation of conditioning information in performance evaluation models is supported by our findings, as it improves the explanatory power of the models and there is evidence of both time-varying betas and alphas related to the public information variables. It is also shown that the number of lags to be used in the stochastic detrending procedure is a critical choice, as it will impact the significance of the conditioning information. In addition, we observe a distance effect, since managers who invest locally seem to outperform those who invest in the European market. However, after controlling for public information, this effect is slightly reduced. Furthermore, the results suggest that survivorship bias has a small impact on performance estimates.

Higher-order lazy functional slicing

Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, and corresponding tools, target either the imperative or the object oriented paradigms, where program slices are computed with respect to a variable or a program statement. Taking a complementary point of view, this paper focuses on the slicing of higher-order functional programs under a lazy evaluation strategy. A prototype of a Haskell slicer, built as proof-of-concept for these ideas, is also introduced