Concept

Type énuméré

Publications associées (36)

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

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

Programming with Enumerable Sets of Structures

Viktor Kuncak, Ivan Kuraj, Daniel Jackson

We present an efficient, modular, and feature-rich framework for automated generation and validation of complex structures, suitable for tasks that explore a large space of structured values. Our framework is capable of exhaustive, incremental, parallel, a ...

Assoc Computing Machinery2015

Introducing a preliminary Consists Selection in the Locomotive Assignment Problem

Michel Bierlaire, Francesco Piu, Prem Kumar

The Locomotive Assignment Problem (LAP) is a class of planning and scheduling problems solved by assigning a fleet of locomotives to a network of trains. In the planning versions of the LAP, the type of consist (a group of linked locomotives) assigned to e ...

Elsevier2015

Interoperation between Miniboxing and Other Generics Translations

Milos Stojanovic

Generics allow programmers to design algorithms and data structures that operate in the same way regardless of the data used by abstracting over data types. Generics are useful as they improve the programmer’s productivity by raising the level of abstracti ...

2015

Linearizability Is Not Always a Safety Property

Rachid Guerraoui, Eric Ruppert

We show that, in contrast to the general belief in the distributed computing community, linearizability, the celebrated consistency property, is not always a safety property. More specifically, we give an object for which it is possible to have an infinite ...

Springer International Publishing2014

Foundations of Path-Dependent Types

Martin Odersky, Tiark Rompf, 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. An essential ingredient of this unification is the concept of objects wit ...

Assoc Computing Machinery2014

Scala Macros: Let Our Powers Combine!

Eugene Burmako

Compile-time metaprogramming has been proven immensely useful enabling programming techniques such as language virtualization, embedding of external DSLs, self-optimization, and boilerplate generation amongst many others. In the recent production release o ...

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

Constraints as Control

Viktor Kuncak, Philippe Paul Henri Suter

We present an extension of Scala that supports constraint programming over bounded and unbounded domains. The resulting language, Kaplan, provides the benefits of constraint programming while preserving the existing features of Scala. Kaplan integrates con ...

2012

Constraints as Control

Viktor Kuncak, Philippe Paul Henri Suter

ACM Order Department, P O Box 64145, Baltimore, MD 21264 Usa2012