Specialisation of Higher-Order Functions for Debugging
Bernard J. Pope, Lee Naish
Abstract
Open-access reader
Bernard J. Pope, Lee Naish
Abstract
Open-access reader
Because functions are abstract values without convenient print representations, implementing debuggers which support higher-order code is a challenge. We present an algorithm for statically specialising higher-order functions and encoding higher-order values to allow printing. We define our algorithm for a small functional language and discuss how it may be extended to support sophisticated features of modern functional programming languages. This research forms part of a project3 to build a declarative debugger for Haskell, based primarily on source-to-source transformation.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Because functions are abstract values without convenient print representations, implementing debuggers which support higher-order code is a challenge. We present an algorithm for statically specialising higher-order functions and encoding higher-order values to allow printing. We define our algorithm for a small functional language and discuss how it may be extended to support sophisticated features of modern functional programming languages. This research forms part of a project3 to build a declarative debugger for Haskell, based primarily on source-to-source transformation.
Key concepts: Haskell, Debugger, Programming language, Computer science, Functional programming, Debugging, Order (exchange), Transformation (genetics)