Publications related to Additional Material for "Unifying Data Representation Transformations"

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.

Function Passing: A Model for Typed, Distributed Functional Programming

Philipp Haller, Jocelyn Boullier

The most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model we call function passing designed to provide a more principled substrate on which to build data-centric distributed systems. A key id ...

Assoc Computing Machinery2016

Implementing Higher-Kinded Types in Dotty

Martin Odersky, Guillaume André Fradji Martres, Dmytro Petrashko

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

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

Martin Odersky, Vlad Ureche, Cédric Bastin

The ScalaDyno compiler plugin allows fast prototyping with the Scala programming language, in a way that combines the benefits of both statically and dynamically typed languages. Static name resolution and type checking prevent partially-correct code from ...

ACM2014

Complete Completion using Types and Weights

Viktor Kuncak, Tihomir Gvero, Ivan Kuraj, Ruzica Piskac

Developing modern software typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that synthesizes ...

ACM2013

Quasiquotes for Scala

Martin Odersky, Eugene Burmako, Denys Shabalin

We introduce quasiquotes for the Scala programming language, which solve the problem of manual tree construction and deconstruction. Included case studies show that quasiquotes indeed are easier to work with than existing tools for tree construction. When ...

2013

On Complete Completion using Types and Weights

Viktor Kuncak, Tihomir Gvero, Ivan Kuraj, Ruzica Piskac

Developing modern software applications typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that ...

2012

On Fast Code Completion using Type Inhabitation

Viktor Kuncak, Tihomir Gvero, Ivan Kuraj, Ruzica Piskac

2012

Lightweight Polymorphic Effects

Martin Odersky, Philipp Haller, Lukas Rytz

Type-and-effect systems are a well-studied approach for reasoning about the computational behavior of programs. Nevertheless, there is only one example of an effect system that has been adopted in a wide-spread industrial language: Java’s checked exception ...

Springer-Verlag2012

Additional Material for "Unifying Data Representation Transformations"

Graph Chatbot

Chat with Graph Search

Function Passing: A Model for Typed, Distributed Functional Programming

Implementing Higher-Kinded Types in Dotty

Decrypting Local Type Inference

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

Complete Completion using Types and Weights

Quasiquotes for Scala

On Complete Completion using Types and Weights

On Fast Code Completion using Type Inhabitation

Lightweight Polymorphic Effects

On Accelerating Interpolants

Function Passing: A Model for Typed, Distributed Functional Programming

Implementing Higher-Kinded Types in Dotty

Lightweight Polymorphic Effects

Complete Completion using Types and Weights

On Fast Code Completion using Type Inhabitation

Decrypting Local Type Inference

On Complete Completion using Types and Weights

Quasiquotes for Scala

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

On Accelerating Interpolants