MATHEMATICAL ENGINEERING TECHNICAL REPORTS Solving Maximum Weighted-sum Problems for Free

[1]  Janis Voigtländer,et al.  Concatenate, reverse and map vanish for free , 2002, ICFP '02.

[2]  Simon Peyton Jones,et al.  Playing by the rules: rewriting as a practical optimisation technique in GHC , 2001 .

[3]  Andrew John Gill,et al.  Cheap deforestation for non-strict functional languages , 1996 .

[4]  Mizuhito Ogawa,et al.  Maximum Marking Problems with Accumulative Weight Functions , 2005, ICTAC.

[5]  Olaf Chitil,et al.  Typer inference builds a short cut to deforestation , 1999, ICFP '99.

[6]  Akihiko Takano,et al.  Shortcut deforestation in calculational form , 1995, FPCA '95.

[7]  Richard S. Bird.  Maximum marking problems , 2001, J. Funct. Program..

[8]  Wei-Ngan Chin,et al.  Redundant Call Elimination via Tupling , 2006, Fundam. Informaticae.

[9]  Richard S. Bird,et al.  Algebraic Identities for Program Calculation , 1989, Comput. J..

[10]  Fritz Henglein.  Generic discrimination: sorting and paritioning unshared data in linear time , 2008, ICFP 2008.

[11]  Philip Wadler,et al.  Theorems for free! , 1989, FPCA.

[12]  Yanhong A. Liu,et al.  Optimizing aggregate array computations in loops , 2005, TOPL.

[13]  Shin-Cheng Mu.  Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths , 2008, PEPM '08.

[14]  Jon Louis Bentley,et al.  Programming pearls , 1987, CACM.

[15]  Robert Glück,et al.  Relating Accumulative and Non-accumulative Functional Programs , 2001, RTA.

[16]  Yanhong A. Liu,et al.  Dynamic Programming via Static Incrementalization , 2003, High. Order Symb. Comput..

[17]  Oege de Moor,et al.  Categories, relations and dynamic programming , 1994, Mathematical Structures in Computer Science.

[18]  Craig A. Tovey,et al.  Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families , 1992, Algorithmica.

[19]  Peter J. Stuckey,et al.  Automating branch-and-bound for dynamic programs , 2008, PEPM '08.

[20]  Simon L. Peyton Jones,et al.  Type classes in Haskell , 1994, TOPL.

[21]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[22]  Peyton Jones,et al.  Haskell 98 language and libraries : the revised report , 2003 .

[23]  Mizuhito Ogawa,et al.  Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems , 2000, ICFP '00.

[24]  Erik Poll,et al.  Algebra of Programming by Richard Bird and Oege de Moor, Prentice Hall, 1996 (dated 1997). , 1999 .

[25]  Robert Giegerich,et al.  A discipline of dynamic programming over sequence data , 2004, Sci. Comput. Program..

[26]  Richard S. Bird,et al.  Algebra of programming , 1997, Prentice Hall International series in computer science.

[27]  Simon L. Peyton Jones,et al.  A short cut to deforestation , 1993, FPCA '93.

[28]  Akihiko Takano,et al.  Tupling calculation eliminates multiple data traversals , 1997, ICFP '97.

[29]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[30]  John Launchbury,et al.  Warm fusion: deriving build-catas from recursive definitions , 1995, FPCA '95.

[31]  Guy E. Blelloch,et al.  Selective memoization , 2003, POPL '03.

[32]  Éva Tardos,et al.  Algorithm design , 2005 .