Publication

On Repairing Ill-Typed Expressions

Publications associées (34)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism

Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki

Type inference in the presence of first-class or "impredicative" second-order polymorphism a la System F has been an active research area for several decades, with original works dating back to the end of the 80s. Yet, until now many basic problems remain ...

Assoc Computing Machinery2024

Macrocyclization of omega-Isocyanoaldehydes and Towards the Total Synthesis of Jamaicensamide A

Teerawat Songsichan

In the first chapter of this thesis, the macrocyclization of a new type of bifunctional substrates, omega-isocyanoaldehyde derivatives, is described. Ten different omega-isocyanoaldehydes in terms of different ring sizes and functional groups were prepared ...

EPFL2021

Zippy LL(1) Parsing with Derivatives

Viktor Kuncak, Jad Hamza, Romain Edelmann

In this paper, we present an efficient, functional, and formally verified parsing algorithm for LL(1) context-free expressions based on the concept of derivatives of formal languages. Parsing with derivatives is an elegant parsing technique, which, in the ...

ASSOC COMPUTING MACHINERY2020

In this thesis, we present Stainless, a verification system for an expressive subset of the Scala language. Our system is based on a dependently-typed language and an algorithmic type checking procedure which ensures total correctness. We rely on SMT solve ...

EPFL2019

Des bactéries pour soutenir le sol de Rances

Rances in the north of Vaud suffered last year from the effects of large soil movement. Rances became the new playground where MeduSoil technology was tested as a remediation for this type of events. This is a decisive new step, after the technology has be ...

2018

Two approaches to portable macros

Eugene Burmako, Fengyun Liu

For any programming language that supports macros and has multiple implementations (each with different AST definitions), there is a common problem: how to make macros that operate on ASTs portable among different compiler implementations? Implementing por ...

2017

A Monometallic Iron(I) Organoferrate

Xile Hu, Matthew Wodrich, Fedor Zhurkin

Tetra-n-butylammonium (TBA) (eta(6)-biphenyl)diphenyfferrate was formed unexpectedly in the reaction of (TBA)(2)[Fe4S4Cl4] with an excess of phenyllithium. This complex belongs to a novel type of organoferrate. ...

American Chemical Society2017

Locality of the anomalous Hall conductivity

Antimo Marrazzo

The geometrical intrinsic contribution to the anomalous Hall conductivity (AHC) of a metal is commonly expressed as a reciprocal-space integral: as such, it only addresses unbounded and macroscopically homogeneous samples. Here we show that the geometrical ...

Amer Physical Soc2017

Statically typed languages verify programs at compile-time. As a result many programming mistakes are detected at an early stage of development. A programmer does not have to specify types for every single term manually, however. Many programming languages ...

EPFL2016

A Generic Algorithm for Checking Exhaustivity of Pattern Matching

Fengyun Liu

Algebraic data types and pattern matching are key features of functional programming languages. Exhaustivity checking of pattern matching is a safety belt that defends against unmatched exceptions at runtime and boosts type safety. However, the presence of ...

Assoc Computing Machinery2016