[Haskell-cafe] Using type families to define runtime
representation and evaluation strategy?
wss at Cs.Nott.AC.UK
Wed Jun 3 17:37:13 EDT 2009
On 3 Jun 2009, at 20:49, Corey O'Connor wrote:
> I'm interested in the feasibility of extending the compiler using a
> construct similar to type synonym families to determine runtime
> representation and evaluation strategy for types. Can anybody point me
> to existing work in this area?
You may also want to look at work by Paul Levy on "Call-by-push-value"
and more recently, Noam Zeilberger (and others at CMU) on focussing.
Both use types to control when and how evaluation happens.
Hope this helps,
This message has been checked for viruses but the contents of an attachment
may still contain software viruses, which could damage your computer system:
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.
More information about the Haskell-Cafe