Concept

Mixin

Related publications (20)

Type-Preserving Compilation of Class-Based Languages

The Dependent Object Type (DOT) calculus was designed to put Scala on a sound basis, but while DOT relies on structural subtyping, Scala is a fundamentally class-based language. This impedance mismatch means that a proof of DOT soundness by itself is ...

EPFL2023

A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning

Yichen Xu, Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki

Many programming languages in the OO tradition now support pattern matching in some form. Historical examples include Scala and Ceylon, with the more recent additions of Java, Kotlin, TypeScript, and Flow. But pattern matching on generic class hierarchies ...

New York2022

Type-preserving compilation of (most of) FGJ into DOT

Guillaume André Fradji Martres

2022

Contrasting processes drive alpha and beta taxonomic, functional and phylogenetic diversity of orthopteran communities in grasslands

François Gillet, Bertrand Fournier

Taxonomic, functional and phylogenetic diversities can respond differently to biotic and abiotic filters. However, biodiversity management tends to focus on a single index, generally taxonomic diversity, assuming a strong positive correlation among biodive ...

Elsevier Science Bv2017

Offer semantics: Achieving compositionality, flattening and full expressiveness for the glue operators in BIP

Simon Bliudze, Eduard Baranov

Based on a concise but comprehensive overview of some fundamental properties required from component-based frameworks, namely compositionality, incrementality, flattening, modularity and expressiveness, we review three modifications of the semantics of glu ...

Elsevier2015

Offer Semantics: Achieving Compositionality, Flattening and Full Expressiveness for the Glue Operators in BIP

Simon Bliudze, Eduard Baranov

2014

Bridging Islands of Specialized Code using Macros and Reified Types

Nicolas Alexander Stucki, Vlad Ureche

Parametric polymorphism in Scala suffers from the usual drawback of erasure on the Java Virtual Machine: primitive values are boxed, leading to indirect access, wasteful use of heap memory and lack of cache locality. For performance-critical parts of the c ...

2013

What are the Odds? Probabilistic programming in Scala

Tiark Rompf, Nada Amin, Sandro Stucki, Manohar Jonnalagedda

Probabilistic programming is a powerful high-level paradigm for probabilistic modeling and inference. We present Odds, a small domain-specific language (DSL) for probabilistic programming, embedded in Scala. Odds provides first-class support for random var ...

ACM2013

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

Dependent Object Types

Martin Odersky, Nada Amin

We propose a new type-theoretic foundation of Scala and languages like it: the Dependent Object Types (DOT) calculus. DOT models Scala’s path-dependent types, abstract type members and its mixture of nominal and structural typing through the use of reﬁneme ...

2012

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.