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.

Compiling Scala for Performance

Iulian Dragos

Scala is a new programming language bringing together object-oriented and functional programming. Its defining features are uniformity and extensibility. Scala offers great flexibility for programmers, allowing them to grow the language through libraries. ...

EPFL2010

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the program execute and thereby read the important dynamic configuration data, the ...

Springer2010

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

2010

Programming language abstractions for mobile code

Stéphane Micheloud

Scala is a general-purpose programming language developed at EPFL. It combines the most important concepts found in object-oriented and functional languages. Scala is a statically typed language; in particular it features an advanced type system and suppor ...

EPFL2009

Implementing First-Class Polymorphic Delimited Continuations by a Type-Directed Selective CPS-Transform

Martin Odersky, Tiark Rompf, Ingo Maier

We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement a simple type and effect system, which discriminates expressions with control eff ...

ACM2009

Implementing First-Class Polymorphic Delimited Continuations by a Type-Directed Selective CPS-Transform

Martin Odersky, Tiark Rompf, Ingo Maier

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2009

On Static Analysis for Expressive Pattern Matching

Viktor Kuncak, Philippe Paul Henri Suter, Mirco Dotta

Pattern matching is a widespread programming language construct that enables definitions of values by cases, generalizing if-then-else and case statements. The cases in a pattern matching expression should be exhaustive: when the value does not match any o ...

2008

Runtime Checking for Separation Logic

Viktor Kuncak

Separation logic is a popular approach for specifying properties of recursive mutable data structures. Several existing systems verify a subclass of separation logic specifications using static analysis techniques. Checking data structure specifications du ...

Springer2008

Continuations in the Java Virtual Machine

Iulian Dragos, Antonio Cunei

Continuations have received considerable attention lately as a possible solution to web application development. Other uses proposed in the past, such as cooperative threading, coroutines or writing iterators, made them an attractive feature of dynamically ...

Technische Universität Berlin2007

Runtime Checking for Separation Logic

Viktor Kuncak

2007