Worker/Wrapper/Makes it/Faster

被引：8

作者：

Hackett, Jennifer ^{[1
]}

Hutton, Graham ^{[1
]}

机构：

[1] Univ Nottingham, Sch Comp Sci, Nottingham, England

来源：

ICFP'14: PROCEEDINGS OF THE 2014 ACM SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING | 2014年

关键词：

general recursion; improvement;

D O I：

10.1145/2628136.2628142

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Much research in program optimization has focused on formal approaches to correctness: proving that the meaning of programs is preserved by the optimisation. Paradoxically, there has been comparatively little work on formal approaches to efficiency: proving that the performance of optimized programs is actually improved. This paper addresses this problem for a general-purpose optimization technique, the worker/wrapper transformation. In particular, we use the call-by-need variant of improvement theory to establish conditions under which the worker/wrapper transformation is formally guaranteed to preserve or improve the time performance of programs in lazy languages such as Haskell.

引用

页码：95 / 107

页数：13

共 31 条

[1]

[Anonymous], 1995, C RECORD POPL 95 22, DOI [DOI 10.1145/199448.199507, 10.1145/199448.199507]

[2]

[Anonymous], 1999, PURELY FUNCTIONAL DA

[3] TRANSFORMATION SYSTEM FOR DEVELOPING RECURSIVE PROGRAMS [J].

BURSTALL, RM ;

DARLINGTON, J .

JOURNAL OF THE ACM, 1977, 24 (01) :44-67

[4]

CLAESSEN K., 2000, ICFP

[5]

COQUAND T, 1993, LECT NOTES COMPUTER, V806

[6] The HERMIT in the Machine A Plugin for the Interactive Transformation of GHC Core Language Programs [J].

Farmer, Andrew ;

Gill, Andy ;

Komp, Ed ;

Sculthorpe, Neil .

ACM SIGPLAN NOTICES, 2012, 47 (12) :1-12

[7]

Gill A., 2009, J FUNCTIONAL PROGRAM, V19

[8]

Gustavsson J., 1999, Electronic Notes in Theoretical Computer Science, V26, DOI 10.1016/S1571-0661(05)80284-1

[9]

GUSTAVSSON J, 2001, ICFP, V36, P265

[10]

Hackett J., 2013, 25 INT S IMPL APPL F

← 1 2 3 4 →