Programming Languages and Systems

Volume 4279 of the series Lecture Notes in Computer Science pp 148-164

Automatic Testing of Higher Order Functions

  • Pieter KoopmanAffiliated withNijmegen Institute for Computer and Information Science
  • , Rinus PlasmeijerAffiliated withNijmegen Institute for Computer and Information Science

* Final gross prices may vary according to local VAT.

Get Access


This paper tackles a problem often overlooked in functional programming community: that of testing. Fully automatic test tools like Quickcheck and G ∀  ST can test first order functions successfully. Higher order functions, HOFs, are an essential and distinguishing part of functional languages. Testing HOFs automatically is still troublesome since it requires the generation of functions as test argument for the HOF to be tested. Also the functions that are the result of the higher order function needs to be identified. If a counter example is found, the generated and resulting functions should be printed, but that is impossible in most functional programming languages. Yet, bugs in HOFs do occur and are usually more subtle due to the high abstraction level.

In this paper we present an effective and efficient technique to test higher order functions by using intermediate data types. Such a data type mimics and controls the structure of the function to be generated. A simple additional function transforms this data structure to the function needed. We use a continuation based parser library as main example of the tests. Our automatic testing method for HOFs reveals errors in the library that was used for a couple of years without problems.