Template meta-programming for Haskell

Authors:
Tim Sheard;Simon Peyton Jones
Affiliations:
Oregon Health & Science University;Microsoft Research Ltd.
Venue:
ACM SIGPLAN Notices
Year:
2002

Citing 11
Cited 26

Macros that work

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Syntactic abstraction in Scheme

Lisp and Symbolic Computation
Multi-stage programming with explicit annotations

PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Dynamic typing as staged type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hygienic macro expansion

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
First-class macros have types

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Impact of economics on compiler optimization

Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande
Macros as multi-stage computations: type-safe, generative, binding macros in MacroML

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Special forms in Lisp

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Functional unparsing

Journal of Functional Programming
Accomplishments and research challenges in meta-programming

SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation

Mirrors: design principles for meta-level facilities of object-oriented programming languages

OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Associated type synonyms

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Variadic templates for C++

Proceedings of the 2007 ACM symposium on Applied computing
Using Template Haskell for Abstract Interpretation

Electronic Notes in Theoretical Computer Science (ENTCS)
Jeannie: granting java native interface developers their wishes

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
A comparison of c++ concepts and haskell type classes

Proceedings of the ACM SIGPLAN workshop on Generic programming
Type-safe diff for families of datatypes

Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
Invertible syntax descriptions: unifying parsing and pretty printing

Proceedings of the third ACM Haskell symposium on Haskell
Lightweight modular staging: a pragmatic approach to runtime code generation and compiled DSLs

GPCE '10 Proceedings of the ninth international conference on Generative programming and component engineering
Language virtualization for heterogeneous parallel computing

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Generic programming with c++ concepts and haskell type classes: A comparison

Journal of Functional Programming
Explicitly recursive grammar combinators: a better model for shallow parser DSLs

PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages
Algebraic Specialization of Generic Functions for Recursive Types

Electronic Notes in Theoretical Computer Science (ENTCS)
Hobbits for Haskell: a library for higher-order encodings in functional programming languages

Proceedings of the 4th ACM symposium on Haskell
Binders unbound

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Monad factory: type-indexed monads

TFP'10 Proceedings of the 11th international conference on Trends in functional programming
Lightweight modular staging: a pragmatic approach to runtime code generation and compiled DSLs

Communications of the ACM
The right kind of generic programming

Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
Deconstraining DSLs

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Marco: safe, expressive macros for any language

ECOOP'12 Proceedings of the 26th European conference on Object-Oriented Programming
A meta-circular language for active libraries

PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Grammar fragments fly first-class

Proceedings of the Twelfth Workshop on Language Descriptions, Tools, and Applications
A typed monadic embedding of aspects

Proceedings of the 12th annual international conference on Aspect-oriented software development
Handlers in action

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Extending Type Inference to Variational Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
The formalization of syntax-based mathematical algorithms using quotation and evaluation

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.02

Visualization

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.