Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Type énuméré

Publications associées (19)

Type-Level Programming with Match Types

Martin Odersky, Olivier Eric Paul Blanvillain

Type-level programming is becoming more and more popular in the realm of functional programming. However, the combination of type-level programming and subtyping remains largely unexplored in practical programming languages. This paper presents match types ...

ASSOC COMPUTING MACHINERY2022

A Performance Evaluation of Local Features for Image-Based 3D Reconstruction

Pascal Fua, Bin Fan

This paper performs a comprehensive and comparative evaluation of the state of the art local features for the task of image based 3D reconstruction. The evaluated local features cover the recently developed ones by using powerful machine learning technique ...

2019

Mitsuba 2: A Retargetable Forward and Inverse Renderer

Wenzel Alban Jakob, Tizian Lucien Zeltner, Merlin Eléazar Nimier-David, Delio Aleardo Vicini

Modern rendering systems are confronted with a dauntingly large and growing set of requirements: in their pursuit of realism, physically based techniques must increasingly account for intricate properties of light, such as its spectral composition or polar ...

ASSOC COMPUTING MACHINERY2019

SPADE: Tuning scale-out OLTP on modern RDMA clusters

Rachid Guerraoui, Aleksandar Dragojevic, Georgios Chatzopoulos

Distributed transactions on modern RDMA clusters promise high throughput and low latency for scale-out workloads. As such, they can be particularly beneficial to large OLTP workloads, which require both. However, achieving good performance requires tuning ...

Association for Computing Machinery2018

Predictive models for assessing the passive solar and daylight potential of neighborhood designs: A comparative proof-of-concept study

Marilyne Andersen, Emmanuel Rey, Émilie Nault

Despite recent developments, neighborhood-scale performance assessment at the early-design phase is seldom carried out in practice, notably due to high computational complexity, time requirement, and perceived need for expert knowledge, ultimately limiting ...

2017

Higher-Order Subtyping with Type Intervals

Sandro Stucki

Modern, statically typed programming languages provide various abstraction facilities at both the term- and type-level. Common abstraction mechanisms for types include parametric polymorphism -- a hallmark of functional languages -- and subtyping -- which ...

EPFL2017

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

Programming with Enumerable Sets of Structures

Viktor Kuncak, Ivan Kuraj

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

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

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

Improving API Documentation for Java-like Languages

Gilles Dubochet

The Javadoc paradigm for displaying API documentation to users is quite popular, with similar variants existing for many mainstream languages. However, two user interface design properties of Javadoc may reduce its utility when displaying documentation for ...

2010

Compiling Scala for Performance

Iulian Dragos

Scala is a new programming language bringing together object-oriented and functional programming. Its defining features are uniformity and extensibility. Scala offers great flexibility for programmers, allowing them to grow the language through libraries. ...

EPFL2010

Decision Procedures for Algebraic Data Types with Abstractions

Viktor Kuncak, Philippe Paul Henri Suter

We describe a family of decision procedures that extend the decision procedure for quantifier-free constraints on recursive algebraic data types (term algebras) to support recursive abstraction functions. Our abstraction functions are catamorphisms (term a ...

2010

Cryptographic protocol logic: Satisfaction for (timed) Dolev-Yao cryptography

Simon Kramer

This article is about a breadth-first exploration of logical concepts in cryptography and their linguistic abstraction and model-theoretic combination in a comprehensive logical system, called CPL (for Cryptographic Protocol Logic). We focus on two fundame ...

2008

Foundations for SCALA : semantics and proof of virtual types

Vincent Cremet

SCALA is an attractive programming language because it is both very expressive and statically strongly typed. This marriage against nature comes at the price of a certain complexity in the language constructs and the static analysis. This complexity makes ...

EPFL2006

Publications associées (19)

Type-Level Programming with Match Types

Martin Odersky, Olivier Eric Paul Blanvillain

ASSOC COMPUTING MACHINERY2022

A Performance Evaluation of Local Features for Image-Based 3D Reconstruction

Pascal Fua, Bin Fan

2019

Mitsuba 2: A Retargetable Forward and Inverse Renderer

Wenzel Alban Jakob, Tizian Lucien Zeltner, Merlin Eléazar Nimier-David, Delio Aleardo Vicini

ASSOC COMPUTING MACHINERY2019

SPADE: Tuning scale-out OLTP on modern RDMA clusters

Rachid Guerraoui, Aleksandar Dragojevic, Georgios Chatzopoulos

Association for Computing Machinery2018

Predictive models for assessing the passive solar and daylight potential of neighborhood designs: A comparative proof-of-concept study

Marilyne Andersen, Emmanuel Rey, Émilie Nault

2017

Higher-Order Subtyping with Type Intervals

Sandro Stucki

EPFL2017

A generic algorithm for checking exhaustivity of pattern matching

Fengyun Liu

2016

Dependent Object Types

Nada Amin

EPFL2016

Programming with Enumerable Sets of Structures

Viktor Kuncak, Ivan Kuraj

Assoc Computing Machinery2015

Introducing a preliminary Consists Selection in the Locomotive Assignment Problem

Michel Bierlaire, Francesco Piu

Elsevier2015

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