Template meta-programming for Haskell

Sheard, Tim; Jones, Simon Peyton

doi:10.1145/581690.581691

Cited by 342 publications

(101 citation statements)

References 11 publications

Supporting

Mentioning

101

Contrasting

Order By: Relevance

“…So the issues just discussed arise in many logics and on many levels. ) We mention staged computation, as in for example MetaML [26,28], Template Haskell [32], and Converge [34]. These languages offer a program enough control of its own execution that it can suspend its own execution, compose suspended programs into larger (suspended) programs, pass suspended programs as arguments to functions, and evaluate them.…”

Section: Discussionmentioning

confidence: 99%

A new calculus of contexts

Gabbay

2005

Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

We study contexts (terms with holes) by proposing a 'λ-calculus with holes'. It is very expressive and can encode programming constructs apparently unrelated to contexts, including objects and algorithms in partial evaluation. We give proofs of confluence, preservation of strong normalisation, principal typing for an ML-style Hindley-Milner type system, and an applicative characterisation of contextual equivalence. We explore the limitations of the calculus including further applications, and discuss how they might be tackled. 1

show abstract

Section: Discussionmentioning

confidence: 99%

A new calculus of contexts

Gabbay

2005

Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

show abstract

“…The Representable instances are required by the generic programming library we use, and are obtained using Template Haskell (Sheard and Peyton Jones 2002) with no added complexity for the user. The Generate type class implements the generic function.…”

Section: Generic Data Generation With Constraintsmentioning

confidence: 99%

Functional generation of harmony and melody

Magalhães

Koops

2014

Proceedings of the 2nd ACM SIGPLAN International Workshop on Functional Art, Music, Modeling &Amp; Design

View full text Add to dashboard Cite

We present FCOMP, a system for automatic generation of harmony and accompanying melody. Building on previous work on functional modelling of musical harmony, FCOMP first creates a foundational harmony by generating random (but user-guided) values of a datatype that encodes the rules of tonal harmony. Then, a melody that fits to the harmony is generated in a compositional sequence: generate all "possible" melodies, filter them to remove obvious bad choices, pick one candidate note per chord, and then embellish the resulting melodic line.At this very early stage, we aim to define a solid system as a foundation that can be used to further improve upon. We care especially about modularity, so that each individual part of the pipeline can be easily improved, and ease of adaptation, so that users can quickly adapt the generated music to their liking. The resulting system generates simple but harmonious music, and serves as a good case study on how functional programming enables quick and clean prototyping of new ideas, even in the realm of automatic music composition.

show abstract

“…Current research in the field of metaprogramming make possible support of metaprogramming in more convenient language (e.g. in Haskell with esoteric functional semantics but modern and reasonable syntax [14]) and even in almost usual procedural language as Converge (with syntax similar to Python, but semantics based on Icon). The implementation of metaprogramming language in Converge reuses some constructs based in Lisp semantic macros and quasi-quotations, but also innovates specialized DSL constructs [16].…”

Section: Present Solutionsmentioning

confidence: 99%

Will we think in programming languages?

Fišer¹

2012

AIP

View full text Add to dashboard Cite

Modern science commonly uses computer modelling. Thousands of scientific model are daily transformed to computers programs and tested. The transformation must overcome the gap between abstract human formal notation and low level semantics of contemporary programming languages. The simultaneous knowledge of specific scientific models and programming languages is an unpleasant necessity for a significant proportion of scientists and practitioners (engineers, economist, etc.). But a solution exists -accommodation of programming languages to mental models of their users. The article discuss one partial solution -implementation of domain specific languages in the heart of existing universal languages by mechanisms of metaprogramming. This mechanism overcomes limitations of classical programming languages and complexity of creation new languages from scratch. However, the support of metaprogramming in contemporary languages is limited to isolated and peripheral constructs in very few languages. These constructs are demonstrated by simplified but real examples (metaobject system of Python, monads in F# and macro-based metaprogramming of Boo language) together with discussion of their advantages and disadvantages. The discussion of examples is aimed to finding requirements for new languages and their implementation in a original (parent) language.

show abstract

Template meta-programming for Haskell

Cited by 342 publications

References 11 publications

A new calculus of contexts

A new calculus of contexts

Functional generation of harmony and melody

Will we think in programming languages?

Contact Info

Product

Resources

About