@article(AbelAltenkirch,
 author       = {A.~Abel and T.~Altenkirch},
 year         = {2002},
 title        = {A {P}redicative {A}nalysis of {S}tructural {R}ecursion},
 journal      = {Journal of Functional Programming},
 volume       = {12},
 number       = {1},
 doi          = {10.1017/S0956796801004191},
)
@article(BT-DLAL,
 author       = {Patrick Baillot and Kazushige Terui},
 year         = {2009},
 title        = {Light types for polynomial time computation in lambda calculus},
 journal      = {Information and {C}omputation},
 volume       = {207},
 number       = {1},
 pages        = {41--62},
 doi          = {10.1016/j.ic.2008.08.005},
)
@article(BC92,
 author       = {S.~Bellantoni and S.~Cook},
 year         = {1992},
 title        = {A new recursion-theoretic characterization of the poly-time functions},
 journal      = {Computational Complexity},
 volume       = {2},
 doi          = {10.1007/BF01201998},
)
@incollection(Cob65,
 author       = {A.~Cobham},
 year         = {1962},
 title        = {The intrinsic computational difficulty of functions},
 editor       = {Y.~Bar-Hillel},
 booktitle    = {CLMPS},
 doi          = {10.2307/2270886},
)
@article(Cocke:1970:GCS:390013.808480,
 author       = {John Cocke},
 year         = {1970},
 title        = {Global Common Subexpression Elimination},
 journal      = {SIGPLAN Not.},
 volume       = {5},
 number       = {7},
 doi          = {10.1145/390013.808480},
)
@article(GirardLL,
 author       = {J.-Y. Girard},
 year         = {1987},
 title        = {Linear Logic},
 journal      = {Th. Comp. Sci.},
 volume       = {50},
 doi          = {10.1016/0304-3975(87)90045-4},
)
@inproceedings(Hofmann99,
 author       = {M.~Hofmann},
 year         = {1999},
 title        = {Linear types and {N}on-{S}ize {I}ncreasing polynomial time computation},
 booktitle    = {LICS},
 pages        = {464--473},
 doi          = {10.1109/LICS.1999.782641},
)
@article(KJmwp,
 author       = {Neil~D. Jones and Lars Kristiansen},
 year         = {2009},
 title        = {A flow calculus of \emph{mwp}-bounds for complexity analysis},
 journal      = {Trans. Comp. Logic},
 volume       = {10},
 number       = {4},
 pages        = {28:1--28:41},
 doi          = {10.1145/1555746.1555752},
)
@unpublished(LarsDraft,
 author       = {L.~Kristiansen},
 title        = {Notes on Code Motion},
 note         = {Manuscript},
)
@inproceedings(Kuck:1981:DGC:567532.567555,
 author       = {D.~J. Kuck and R.~H. Kuhn and D.~A. Padua and B.~Leasure and M.~Wolfe},
 year         = {1981},
 title        = {Dependence Graphs and Compiler Optimizations},
 booktitle    = {POPL},
 doi          = {10.1145/567532.567555},
)
@inproceedings(JonesSCP,
 author       = {C.~S. Lee and N.~D. Jones and Ben-Amram, A.~M.},
 year         = {2001},
 title        = {The {S}ize-{C}hange {P}rinciple for {P}rogram {T}ermination},
 booktitle    = {POPL},
 doi          = {10.1145/360204.360210},
)
@article(RCG-ToCL,
 author       = {Jean-Yves Moyen},
 year         = {2009},
 title        = {{Resource control graphs}},
 journal      = {ACM Trans. Computational Logic},
 volume       = {10},
 doi          = {10.1145/360204.360210},
)
@article(LQICM2000,
 author       = {Litong Song and Yoshihiko Futurama and Gl\IeC{\"u}ck, Robert and Zhenjiang Hu},
 year         = {2000},
 title        = {A Loop Optimization Technique Based on Quasi-Invariance},
 pages        = {80--90},
 doi          = {10.1.1.17.8939},
)