Template meta-programming for Haskell
Tim Sheard, Simon Peyton Jones
Abstract
Tim Sheard, Simon Peyton Jones
Abstract
We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming . The purpose of the system is to support the algorithmic construction of programs at compile-time.The ability to generate code at compile time allows the programmer to implement such features as polytypic programs, macro-like expansion, user directed optimization (such as inlining), and the generation of supporting data structures and functions from existing data structures and functions.Our design is being implemented in the Glasgow Haskell Compiler, ghc.
OpenAlex reports 158 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.
We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming . The purpose of the system is to support the algorithmic construction of programs at compile-time.The ability to generate code at compile time allows the programmer to implement such features as polytypic programs, macro-like expansion, user directed optimization (such as inlining), and the generation of supporting data structures and functions from existing data structures and functions.Our design is being implemented in the Glasgow Haskell Compiler, ghc.
Key concepts: Haskell, Computer science, Compiler, Programming language, Compile time, Programmer, Functional programming, Generic programming