Concept

Union type

Publications associées (23)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

A generic algorithm for checking exhaustivity of pattern matching

Fengyun Liu

Algebraic data types and pattern matching are key features of functional programming languages. Exhaustivity checking of pattern matching is a safety belt that defends against unmatched exceptions at runtime and boosts type safety. However, the presence of ...

2016

Dependent Object Types

Nada Amin

A scalable programming language is one in which the same concepts can describe small as well as large parts. Towards this goal, Scala unifies concepts from object and module systems. In particular, objects can contain type members, which can be selected as ...

EPFL2016

Improving the Performance of Scala Collections with Miniboxing

Martin Odersky, Vlad Ureche, Aymeric Genet

Using generics, Scala collections can be used to store different types of data in a type-safe manner. Unfortunately, due to the erasure transformation, the performance of generics is degraded when storing primitive types, such as integers and floating poin ...

2014

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

Free standing modulation doped core-shell GaAs/AlGaAs hetero-nanowires

Anna Fontcuberta i Morral

Modulation doped AlGaAs/GaAs core-shell nanowire structures were grown by molecular beam epitaxy. A Si delta-doping was introduced in the AlGaAs shell around the {110} facets of the GaAs core. The wires are typically highly resistive at low temperatures. H ...

2011

FPGA Design with Double-Gate Carbon Nanotube Transistors

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Mohamed Haykel Ben Jamaa, Michele De Marchi

Double-gate carbon nanotube field effect transistors (DGCNTFETs) are novel devices showing an interesting property allowing to control the p- or n-type behavior during the device operation. This opens up the opportunity for novel design paradigms. Based on ...

2011

Experimental strategies for studying transcription factor-DNA binding specificities

Sebastian Maerkl, Marcel Geertz

Specific binding of transcription factors (TFs) determines in a large part the connectivity of gene regulatory networks as well as the quantitative level of gene expression. A multiplicity of both experimental and computational methods is currently used to ...

2010

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

Concurrency and distribution pose algorithmic and implementation challenges in developing reliable distributed systems, making the field an excellent testbed for evaluating programming language and verification paradigms. Several specialized domain-specifi ...

2009

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

2009

Fibonacci Heaps

Ali Chekir, Mohamed Slim Slama

Binomial heaps are data structures implemented as a collection of binomial trees, (A binomial tree of order K can be constructed from two trees of order (K-1)). They can implement several methods: Min, Insert, Union, ExtractMin, DecreaseKey and Delete. Fib ...

2006