Publications related to Kotlin (programming language)

Just-in-time performance without warm-up

Scala has been developed as a language that deeply integrates with the Java ecosystem. It offers seamless interoperability with existing Java libraries. Since the Scala compiler targets Java bytecode, Scala programs have access to high-performance runtimes ...

EPFL2020

Verified Functional Programming

Nicolas Charles Yves Voirol

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

Observation of B+ -> p(Lambda)over-barK(+) K- and B+ -> (p)over-bar Lambda K+ K+

Olivier Schneider, Yiming Li, Mingkui Wang, Chao Wang, Tagir Aushev, Sun Hee Kim, Tara Nanut, Jun Yong Kim, Ji Hyun Kim, Donghyun Kim, Xiao Wang, Lei Li

We report the study of B+ -> p (Lambda) over barK(+)K(-) and B+ -> (p) over barK(+)K(+) decays using a 772 x 10(6) B (B) over bar pair data sample recorded on the gamma(4S) resonance with the Belle detector at KEKB. The following branching fractions are me ...

American Physical Society2019

Cross-Platform Language Design

Sébastien Jean R Doeraene

Programming languages are increasingly compiled to multiple runtimes, each featuring their own rich structures such as their object model. Furthermore, they need to interact with other languages targeting said runtimes. A language targeting only one runtim ...

EPFL2018

Translating Scala Programs to Isabelle/HOL, Automated Reasoning

Viktor Kuncak

We present a trustworthy connection between the Leon verification system and the Isabelle proof assistant. Leon is a system for verifying functional Scala programs. It uses a variety of automated theorem provers (ATPs) to check verification conditions (VCs ...

2016

Indicators of Evidence for Bioequivalence

Stephan Morgenthaler, Robert Staudte

Some equivalence tests are based on two one-sided tests, where in many applications the test statistics are approximately normal. We define and find evidence for equivalence in Z-tests and then one-and two-sample binomial tests as well as for t-tests. Mult ...

Mdpi Ag2016

Studies of charmed strange baryons in the Lambda D final state at Belle

Olivier Schneider, Yiming Li, Chao Wang, Ho Ling Li, Sun Hee Kim, Tara Nanut, Jun Yong Kim, Ji Hyun Kim, Donghyun Kim, Dipanwita Dutta

We report the discovery of Xi(c)(3055)(0), observed by its decay into the final-state Lambda D-0, and present the first observation and evidence of the decays of Xi(c)(3055)(+) and Xi(c)(3080)(+) into Lambda D+. We also perform a combined analysis of the L ...

American Physical Society2016

Implementing Higher-Kinded Types in Dotty

Martin Odersky, Guillaume André Fradji Martres, Dmytro Petrashko

dotty is a new, experimental Scala compiler based on DOT, the calculus of Dependent Object Types. Higher-kinded types are a natural extension of first-order lambda calculus, and have been a core construct of Haskell and Scala. As long as such types are jus ...

ACM2016

Type Soundness for Dependent Object Types (DOT)

Tiark Rompf, Nada Amin

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

Type Soundness for Dependent Object Types

Tiark Rompf, Nada Amin

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

Automating Ad hoc Data Representation Transformations

Martin Odersky, Vlad Ureche

To maximize run-time performance, programmers often specialize their code by hand, replacing library collections and containers by custom objects in which data is restructured for efficient access. However, changing the data representation is a tedious and ...

Assoc Computing Machinery2015

Scalable and Reactive Programming for Semantic Web Developers

Jean Paul Calbimonte Perez

The Semantic Web brings a powerful set of concepts, standards and ideas that are already changing the shape of the Web. However, in order to put these notions into practice we need to translate them into code. That is why the broad notion of programming th ...

CEUR-WS2015

Improving Human-Compiler Interaction Through Customizable Type Feedback

Martin Odersky, Heather Christine Klug, Hubert Plociniczak

Type errors reported by compilers can sometimes be cryptic, or difficult to understand. In this paper, we propose a type debugging framework that exposes a high-level representation of the typechecking decision-making process that users normally do not hav ...

2014

Building Efficient Query Engines in a High-Level Language

Christoph Koch, Ioannis Klonatos, Tiark Rompf, Hassan Chafi

In this paper we advocate that it is time for a radical rethinking of database systems design. Developers should be able to leverage high-level programming languages without having to pay a price in efficiency. To realize our vision of abstraction without ...

2014

Late Data Layout: Unifying Data Representation Transformations

Martin Odersky, Eugene Burmako, Vlad Ureche

Values need to be represented differently when interacting with certain language features. For example, an integer has to take an object-based representation when interacting with erased generics, although, for performance reasons, the stack-based value re ...

ACM2014

Scala-Virtualized: Linguistic Reuse for Deep Embeddings

Martin Odersky, Tiark Rompf, Philipp Haller, Nada Amin

Scala-Virtualized extends the Scala language to better support hosting embedded DSLs. Scala is an expressive language that provides a flexible syntax, type-level computation using implicits, and other features that facilitate the development of em- bedded ...

Springer Verlag2013

Observation of B- -> pbar Lambda D0 at Belle

Olivier Schneider, Remi Léandre Albert Louvot, Yiming Li, Mingkui Wang, Chao Wang, Tagir Aushev, Jun Yong Kim, Ji Hyun Kim, Xiao Wang, Jing Li

We study B- meson decays to (p) over bar Lambda D-(*)0 final states using a sample of 657 x 10(6) B (B) over bar events collected at the Gamma(4S) resonance with the Belle detector at the KEKB asymmetric-energy e(+)e(-) collider. The observed branching fra ...

American Physical Society2011

Comfusy: A Tool for Complete Functional Synthesis

Viktor Kuncak, Mikaël Mayer, Philippe Paul Henri Suter, Ruzica Piskac

Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the general-purpose programming language Scala with (non-reactive) functional synthesi ...

Springer2010

Named and default arguments for polymorphic object-oriented languages

Martin Odersky, Lukas Rytz

This article describes the design and implementation of named and default arguments in the Scala programming language. While these features are available in many other languages there are significant differences in the actual implementations. We present a ...

ACM2010