Concept

Kotlin (langage)

Publications associées (19)

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

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