Person

Dmytro Petrashko

This person is no longer with EPFL

Related publications (10)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Design and implementation of an optimizing type-centric compiler for a high-level language

Dmytro Petrashko

Production compilers for programming languages face multiple requirements. They should be correct, as we rely on them to produce code. They should be fast, in order to provide a good developer experience. They should also be easy to maintain and evolve. Th ...

EPFL2017

, ,

Production compilers commonly perform dozens of transformations on an intermediate representation. Running those transformations in separate passes harms performance. One approach to recover performance is to combine transformations by hand in order to red ...

Assoc Computing Machinery2017

Auto-Collections for Scala

Dmytro Petrashko, Allan Vincent Roger Renucci

Modern programming languages such as Scala, Java and C# make extensive use of collections. A collection implementation represents a fixed choice in the dimensions of operation time and space utilization. Using the collection in a manner not consistent with ...

2016

, ,

dotty is a new, experimental Scala compiler based on DOT, the calculus of Dependent Object Types. Higher-kinded types are a natural extension of first-order lambda calculus, and have been a core construct of Haskell and Scala. As long as such types are jus ...

ACM2016

, ,

The performance of contemporary object oriented languages depends on optimizations such as devirtualization, inlining, and specialization, and these in turn depend on precise call graph analysis. Existing call graph analyses do not take advantage of the in ...

2016

A TASTY Alternative

Martin Odersky, Eugene Burmako, Dmytro Petrashko

This document proposes a new serialization format for typed syntax trees of Scala programs. It aims to be ● compact: All numbers and references are length encoded, trees are inlined by default but may be shared. ● lazy: Trees can be explored from the top, ...

2016

, ,

This reference manual describes the TASTY serialization format for typed syntax trees representing Scala programs. A motivation and a short summary of the format is found in the companion document A TASTY Alternative . ...

2016

Common Subexpression Elimination in Dotty

Martin Odersky, Dmytro Petrashko, Allan Vincent Roger Renucci

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 mul ...

2015

, ,

Scala is a powerful language which cur- rently provides a built-in library for non- strict Views with some important shortcom- ings for the users such as unexpected and unintuitive behaviors. In this work we cre- ated a new library, based on Scala Blitz, t ...

2014

On Lock-Free Work-stealing Iterators for Parallel Data Structures

Martin Odersky, Aleksandar Prokopec, Dmytro Petrashko

With the rise of multicores, there is a trend of supporting data-parallel collection operations in general purpose programming languages. These operations are highly parametric, incurring abstraction performance penalties. Furthermore, data-parallel operat ...

2014