2002Electronic Notes in Theoretical Computer ScienceOpen access

Specialisation of Higher-Order Functions for Debugging

Bernard J. Pope, Lee Naish

Open full text 3 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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)

Related papers

Back to paper searchBrowse research topicsOriginal source
Specialisation of Higher-Order Functions for Debugging — Research Paper | ScholarLens