Publications by Tiark Rompf | EPFL Graph Search

Type Soundness Proofs with Definitional Interpreters

While type soundness proofs are taught in every graduate PL class, the gap between realistic languages and what is accessible to formal proofs is large. In the case of Scala, it has been shown that its formal model, the Dependent Object Types (DOT) calculu ...

Assoc Computing Machinery2017

LMS-Verify: Abstraction without Regret for Verified Systems Programming’

Nada Amin, Tiark Rompf

Performance critical software is almost always developed in C, as programmers do not trust high-level languages to deliver the same reliable performance. This is bad because low-level code in unsafe languages attracts security vulnerabilities and because d ...

Assoc Computing Machinery2017

Type Soundness for Dependent Object Types

Nada Amin, Tiark Rompf

Scala’s type system unifies aspects of ML modules, object-oriented, and functional programming. The Dependent Object Types (DOT) family of calculi has been proposed as a new theoretic foundation for Scala and similar expressive languages. Unfortunately, ty ...

2016

The Essence of Dependent Object Types

Martin Odersky, Sandro Stucki, Nada Amin, Tiark Rompf, Karl Samuel Grütter

Focusing on path-dependent types, the paper develops foundations for Scala from first principles. Starting from a simple calculus D-

Springer International Publishing2016

Type Soundness for Dependent Object Types (DOT)

Nada Amin, Tiark Rompf

Scala's type system unifies aspects of ML modules, object-oriented, and functional programming. The Dependent Object Types (DOT) family of calculi has been proposed as a new theoretic foundation for Scala and similar expressive languages. Unfortunately, ty ...

Assoc Computing Machinery2016

RRB Vector: A Practical General Purpose Immutable Sequence

Martin Odersky, Tiark Rompf, Vlad Ureche, Nicolas Alexander Stucki

State-of-the-art immutable collections have wildly differing performance characteristics across their operations, often forcing programmers to choose different collection implementations for each task. Thus, changes to the program can invalidate the choice ...

ACM2015

Functional Pearl: A SQL to C Compiler in 500 Lines of Code

Nada Amin, Tiark Rompf

We present the design and implementation of a SQL query processor that outperforms existing database systems and is written in just about 500 lines of Scala code - a convincing case study that high-level functional programming can handily beat C for system ...

Assoc Computing Machinery2015

Staged parser combinators for efficient data processing

Martin Odersky, Sandro Stucki, Thierry Coppey, Manohar Jonnalagedda, Tiark Rompf

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to b ...

ACM Press2014

Surgical Precision JIT Compilers

Tiark Rompf, Hassan Chafi

Just-in-time (JIT) compilation of running programs provides more optimization opportunities than offline compilation. Modern JIT compilers, such as those in virtual machines like Oracle's HotSpot for Java or Google's V8 for JavaScript, rely on dynamic prof ...