reflection
Version 1.1.6 revision 0 uploaded by EdwardKmett.
Package meta
- Synopsis
- Reifies arbitrary terms into types that can be reflected back into terms
- Description
This package provides an implementation of the ideas presented in the paper "Functional Pearl: Implicit Configurations" by Oleg Kiselyov and Chung-chieh Shan. However, the API has been streamlined to improve performance.
The original paper can be obtained from http://www.cs.rutgers.edu/~ccshan/prepose/prepose.pdf.
Changes in 1.1.6:
Relaxed an unnecessary strictness annotation in the fast implementation
Changes in 1.1.5:
Both implementations now work on Hugs; the fast implementation ascends from the ranks of completely unportable black magic to being merely mostly unportable black magic.
Changes from 0.5 to 1.1:
Much faster implementation available that is about 50 times faster than 0.9 and which runs purely on black magic. This version is now used by default. To turn it off install with the
slow
flag. If you encounter a problem with the implementation, please contact the author.Removed
ReifiedNum
,reflectNum
, andreifyIntegral
;reify
andreflect
are about 3 orders of magnitude faster than the special case combinators were.
Changes in 0.5:
Generalized the type signatures in reflect to allow you to pass any type with kind
* -> *
wrapped around the desired type as the phantom type argument rather than just aProxy
.
Changes in 0.4:
Converted from Data.Tagged to using Data.Proxy for reflection. This reduces the need for helper functions and scoped type variables in user code.
- Author
- Edward A. Kmett, Elliott Hird, Oleg Kiselyov and Chung-chieh Shan
- Bug reports
- http://github.com/ekmett/reflection/issues
- Category
- Data, Reflection, Dependent Types
- Copyright
- 2009-2012 Edward A. Kmett, 2012 Elliott Hird, 2004 Oleg Kiselyov and Chung-chieh Shan
- Homepage
- http://github.com/ekmett/reflection
- Maintainer
- Edward A. Kmett <ekmett@gmail.com>
- Package URL
- n/a
- Stability
- experimental