• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Improvements for Free

Cached

  • Download as a PDF

Download Links

  • [wwwtcs.inf.tu-dresden.de]
  • [www.iai.uni-bonn.de]
  • [wwwtcs.inf.tu-dresden.de]
  • [www.iai.uni-bonn.de]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Daniel Seidel , Janis Voigtländer
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Seidel_improvementsfor,
    author = {Daniel Seidel and Janis Voigtländer},
    title = {Improvements for Free},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

“Theorems for Free! ” (Wadler 1989) is a slogan for a technique that allows to derive statements about functions just from their types. So far, the statements considered have always had a purely extensional flavor: statements relating the value semantics of program expressions, but not statements relating their runtime (or other) cost. Here we study an extension of the technique that allows precisely statements of the latter flavor, by deriving quantitative theorems for free. After developing the theory, we walk through a number of example derivations. Probably none of the statements derived in those simple examples will be particularly surprising to most readers, but what is maybe surprising, and at the very least novel, is that there is a general technique for obtaining such results on a quantitative level in a principled way. And, of course, there is good potential to bring that technique to bear on more complex examples as well. 1

Citations

332 Types, abstraction, and parametric polymorphism - Reynolds - 1983
173 A short cut to deforestation - Gill, Launchbury, et al. - 1993
76 Automatic complexity analysis - Rosendahl - 1989
40 A naïve time analysis and its theory of cost equivalence - Sands - 1995
38 Shortcut fusion for accumulating parameters & ziplike functions - Svenningsson - 2002
33 Free theorems in the presence of seq - Johann, Voigtländer - 2004
33 Strictness analysis aids time analysis - Wadler - 1988
27 A compositional approach to time analysis of first order lazy functional programs - Bjerner, Holmstrom - 1989
22 Parametricity and unboxing with unpointed types - Launchbury, Paterson - 1996
13 Bidirectionalization for free - Voigtländer - 2009
11 Automatic Accurate Cost-Bound Analysis for High-Level Languages - Liu, Gómez - 2001
9 Free theorems involving type constructor classes - Voigtländer - 2009
7 Parametricity and dependent types - Bernardy, Jansson, et al.
5 Testing polymorphic properties - Bernardy, Jansson, et al. - 2010
4 Free theorems for sublanguages of Haskell - Böhme - 2007
4 Parametricity for Haskell with imprecise error semantics - Stenger, Voigtländer - 2009
4 ado about two: A pearl on parallel prefix computation - Much - 2008
3 Free theorems for functional logic programs - Christiansen, Seidel, et al. - 2010
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University