Publications associées à Implementing Higher-Kinded Types in Dotty

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Foundations of Path-Dependent Types

Martin Odersky, Tiark Rompf, Nada Amin

A scalable programming language is one in which the same concepts can describe small as well as large parts. Towards this goal, Scala unifies concepts from object and module systems. An essential ingredient of this unification is the concept of objects wit ...

Assoc Computing Machinery2014

Improving the Performance of Scala Collections with Miniboxing

Martin Odersky, Vlad Ureche, Aymeric Genet

Using generics, Scala collections can be used to store different types of data in a type-safe manner. Unfortunately, due to the erasure transformation, the performance of generics is degraded when storing primitive types, such as integers and floating poin ...

2014

The second order pullback equation

Bernard Dacorogna, Olivier Kneuss, Gyula Csató

Let f, g be two closed k-forms over R-n. The pullback equation studies the existence of a diffeomorphism phi : R-n -> R-n such that phi*(g) = f. We prove two types of results. The first one sharpens some of the existing regularity results. The second one d ...

Springer2014

Linearizability Is Not Always a Safety Property

Rachid Guerraoui, Eric Ruppert

We show that, in contrast to the general belief in the distributed computing community, linearizability, the celebrated consistency property, is not always a safety property. More specifically, we give an object for which it is possible to have an infinite ...

Springer International Publishing2014

Computation Over Gaussian Networks With Orthogonal Components

Michael Christoph Gastpar, Chien-Yi Wang

Function computation over Gaussian networks with orthogonal components is studied for arbitrarily correlated discrete memoryless sources. Two classes of functions are considered: 1) the arithmetic sum function and 2) the type function. The arithmetic sum f ...

Institute of Electrical and Electronics Engineers2014

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

Materials Taking a Lesson from Nature

Holger Frauenrath, Emmanuel Croisier, Liangfei Tian

Structural biomaterials with their often extraordinary properties and versatile functions are typically constructed from very limited sets of building blocks and types of supramolecular interactions. In this review we discuss how, inspired by nature's desi ...

Swiss Chemical Soc2013

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

Implementing Higher-Kinded Types in Dotty

Graph Chatbot

Chattez avec Graph Search

Foundations of Path-Dependent Types

Improving the Performance of Scala Collections with Miniboxing

The second order pullback equation

Linearizability Is Not Always a Safety Property

Computation Over Gaussian Networks With Orthogonal Components

Complete Completion using Types and Weights

Materials Taking a Lesson from Nature

On Complete Completion using Types and Weights

On Fast Code Completion using Type Inhabitation

Dependent Object Types

Materials Taking a Lesson from Nature

Complete Completion using Types and Weights

The second order pullback equation

Dependent Object Types

Improving the Performance of Scala Collections with Miniboxing

Foundations of Path-Dependent Types

Linearizability Is Not Always a Safety Property

On Fast Code Completion using Type Inhabitation

Computation Over Gaussian Networks With Orthogonal Components

On Complete Completion using Types and Weights