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. Reports, Documentation, and Standards
  4. Common Subexpression Elimination in Dotty
 
report

Common Subexpression Elimination in Dotty

Renucci, Allan Vincent Roger  
•
Petrashko, Dmytro  
•
Odersky, Martin  
2015

Common subexpression elimination is a well-known compiler optimisa- tion that improves running time of compiled applications by avoiding the repetition of the same computation. Although it has been implemented on a low level such as bytecode, it misses multiple opportunities that are available on high level, such as optimizing lazy vals. We developed and implemented the transformation for Scala in a new mini-phase in the Dotty Compiler.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

Renucci Renucci - 2016 - Common Subexpression Elimination in Dotty Common Subexpression Elimination in Dotty(2).pdf

Access type

openaccess

Size

185.99 KB

Format

Adobe PDF

Checksum (MD5)

3d2937e73b579f4267cbab5e7a8a64bf

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