Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Optimizing Higher-Order Functions in Scala
 
conference paper not in proceedings

Optimizing Higher-Order Functions in Scala

Dragos, Iulian  
2008
Third International Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems

Scala relies on libraries as the default mechanism for language extension. While this provides an elegant solution for growing the language, the performance penalty incurred by call-by-name parameters, boxing and anonymous functions is high. We show that inlining alone is not enough to remove this overhead, and present a solution based on decompilation of library code combined with inlining, dead code elimination, and copy propagation. We evaluate our approach on two language extensions, Java-like assert and C-like for-loops and show improvements of up to 45%.

  • Files
  • Details
  • Metrics
Type
conference paper not in proceedings
Author(s)
Dragos, Iulian  
Date Issued

2008

Subjects

compilers

•

optimization

•

Scala

•

higher order functions

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LAMP1  
Event nameEvent placeEvent date
Third International Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems

Paphos, Cyprus

July 7, 2008

Available on Infoscience
September 25, 2008
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/29696
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés