Publication

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

Related publications (67)

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.

Sensitivity Analysis of a Bottom Reflood Simulation using Morris Screening Method

Andreas Pautz, Damar Canggih Wicaksono, Omar Zerkak

In the work presented in this paper, a sensitivity analysis using the Morris screening method was carried out for a model of the Flooding Experiment with Blocked Arrays (FEBA) separate-effect test facility. The sensitivity analysis was conducted in the con ...

2014

Scala.js: Type-Directed Interoperability with Dynamically Typed Languages

Sébastien Jean R Doeraene

Interoperability between statically typed and dynamically typed languages is increasingly important, as can be witnessed by the many statically typed languages targeting JavaScript. Interoperating with both the object-oriented and functional features of Ja ...

2013

An Embedded Query Language in Scala

Amir Shaikhha

In this thesis we address the problem of integrating general purpose programming languages with relational databases. An approach to solving this problem is using raw strings to represent SQL statements. This approach leads to runtime errors and security v ...

2013

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

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

Implementing a Type Debugger for Scala

Martin Odersky, Hubert Plociniczak

Statically-typed languages offer type systems that are less and less comprehensible for programmers as the language grows in complexity. In this paper, we present a type debugger, a tool that enables analysis of type-related problems as well as exploration ...

2012

Querypoint Debugging (Semi-Automated Inspection of Buggy Execution)

Salman Mirghasemi

Debugging is a hard and time-consuming programming task that appears in the most stages of software development and maintenance. Therefore, any improvement in the debugging practice can significantly reduce the time and costs of software production. In thi ...

EPFL2012

On Effect Analysis for Programs with Callbacks

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number o ...

2012

Toward Interprocedural Pointer and Effect Analysis for Scala

Etienne Kneuss

Static program analysis techniques working on object-oriented languages require precise knowledge of the aliasing relation between variables. This knowledge is important to, among other things, understand the read and write effects of method calls on objec ...

2011

Scala to the Power of Z3: Integrating SMT and Programming

Viktor Kuncak, Philippe Paul Henri Suter

We describe a system that integrates the SMT solver Z3 with the Scala programming language. The system supports the use of the SMT solver for checking satisfiability, unsatisfiability, as well as solution enumeration. The embedding of formula trees into Sc ...

Springer-Verlag Berlin2011