000221666 001__ 221666
000221666 005__ 20190317000539.0
000221666 037__ $$aREP_WORK
000221666 245__ $$aCommon Subexpression Elimination in Dotty
000221666 269__ $$a2015
000221666 260__ $$c2015
000221666 300__ $$a7
000221666 336__ $$aReports
000221666 520__ $$aCommon 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.
000221666 700__ $$0(EPFLAUTH)205095$$aRenucci, Allan Vincent Roger$$g205095
000221666 700__ $$0248093$$aPetrashko, Dmytro$$g233192
000221666 700__ $$0241835$$aOdersky, Martin$$g126003
000221666 8564_ $$s190450$$uhttps://infoscience.epfl.ch/record/221666/files/Renucci%20Renucci%20-%202016%20-%20Common%20Subexpression%20Elimination%20in%20Dotty%20Common%20Subexpression%20Elimination%20in%20Dotty%282%29.pdf$$yn/a$$zn/a
000221666 909C0 $$0252187$$pLAMP$$xU10409
000221666 909CO $$ooai:infoscience.tind.io:221666$$pIC$$preport$$qGLOBAL_SET
000221666 917Z8 $$x233192
000221666 937__ $$aEPFL-REPORT-221666
000221666 973__ $$aEPFL
000221666 980__ $$aREPORT