Prototyping Generic Programming in Template Haskell

Norell, Ulf; Jansson, Patrik

doi:10.1007/978-3-540-27764-4_17

Cited by 9 publications

(9 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They also present an approach to generic programming using template Haskell [30]. Finally, Norell [28] describes an encoding of generic programs in dependent type theory.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Type-based termination of generic programs

Abel

2009

Science of Computer Programming

View full text Add to dashboard Cite

a b s t r a c tInstances of a polytypic or generic program for a concrete recursive type often exhibit a recursion scheme that is derived from the recursion scheme of the instantiation type. In practice, the programs obtained from a generic program are usually terminating, but the proof of termination cannot be carried out with traditional methods as term orderings alone, since termination often crucially relies on the program type. In this article, it is demonstrated that type-based termination using sized types handles such programs very well. A framework for sized polytypic programming is developed which ensures (typebased) termination of all instances.

show abstract

“…They also present an approach to generic programming using template Haskell [30]. Finally, Norell [28] describes an encoding of generic programs in dependent type theory.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Type-based termination of generic programs

Abel

2009

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…Template Haskell Template Haskell (Sheard and Jones 2002) is a metaprogramming system for Haskell in which metaprograms are monadic actions that transform Haskell programs. It has been enabled a great deal of interesting work, including prototype implementations of generic programming extensions (Norell and Jansson 2004). Template Haskell's Q monad, however, does not supply effects related to the elaboration infrastructure of implementations such as GHC.…”

Section: Related Workmentioning

confidence: 99%

“…Similarly, dependent types allow non-trivial data types to be encoded generically, but the dust has not yet settled around which universe encoding of data types is best. Norell and Jansson (2004) describe an application of Template Haskell to implementing novel generic programming systems. Similarly, the Shapeless generic programming library for Scala 5 uses Scala's macro facility to implement its generics, an approach discussed by Burmako (2013).…”

Section: Future Workmentioning

confidence: 99%

Elaborator reflection: extending Idris in Idris

Christiansen

Brady

2016

SIGPLAN Not.

View full text Add to dashboard Cite

Many programming languages and proof assistants are defined by elaboration from a high-level language with a great deal of implicit information to a highly explicit core language. In many advanced languages, these elaboration facilities contain powerful tools for program construction, but these tools are rarely designed to be repurposed by users. We describe elaborator reflection, a paradigm for metaprogramming in which the elaboration machinery is made directly available to metaprograms, as well as a concrete realization of elaborator reflection in Idris, a functional language with full dependent types. We demonstrate the applicability of Idris's reflected elaboration framework to a number of realistic problems, we discuss the motivation for the specific features of its design, and we explore the broader meaning of elaborator reflection as it can relate to other languages.

show abstract

“…It has been enabled a great deal of interesting work, including prototype implementations of generic programming extensions (Norell and Jansson 2004). Template Haskell's Q monad, however, does not supply effects related to the elaboration infrastructure of implementations such as GHC.…”

Section: Related Workmentioning

confidence: 99%