Firstify
This page relates to a transformation which takes a higher-order program,
and a produces an equivalent first-order program. Unlike Reynolds
style defunctionalisation, it does not introduce any new data types,
and the results are more amenable to subsequent analysis operations.
Our transformation is implemented, and works on a Core
language to which Haskell programs can be reduced. Our method
cannot always succeed in removing all functional values, but in
practice is remarkably successful.
Downloads
- Released version
- darcs get --partial http://community.haskell.org/~ndm/darcs/firstify
- Losing Functions without Gaining Data - submitted to ICFP 2009. (abstract)(hide abstract)
We describe a transformation which takes a higher-order program,
and a produces an equivalent first-order program. Unlike Reynolds
style defunctionalisation, it does not introduce any new data types,
and the results are more amenable to subsequent analysis operations.
Our transformation is implemented, and works on a Core
language to which Haskell programs can be reduced. Our method
cannot always succeed in removing all functional values, but in
practice is remarkably successful.
(bibtex)(hide bibtex)@unpublished{mitchell:firstify_2009_3_2
,title = "Losing Functions without Gaining Data"
,author = "Neil Mitchell"
,year = "2009"
,month = "March"
,day = "2"
,note = "Draft, submitted to ICFP 2009."
,url = "\verb'http://community.haskell.org/~ndm/downloads/draft-losing_functions_without_gaining_data-02_mar_2009.pdf'"
}
- First Order Haskell - from BCTCS 2007 (bibtex)(hide bibtex)
@misc{mitchell:firstify_2007_4_6
,title = "First Order {Haskell}"
,author = "Neil Mitchell"
,year = "2007"
,month = "April"
,day = "6"
,note = "Presentation from BCTCS 2007"
,url = "\verb'http://community.haskell.org/~ndm/downloads/slides-first_order_haskell-06_apr_2007.pdf'"
}
Tags: thesis