Publications associées à Flexible subtyping relations for component-oriented formalisms and their verification

Publications associées (23)

Formal Foundations of Capture Tracking

Type systems are a device for verifying properties of programs without running them. Many programming languages used in the industry have always had a type system, while others were initially created without a type system and later adopted one, when the ad ...

EPFL2024

When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism

Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki

Type inference in the presence of first-class or "impredicative" second-order polymorphism a la System F has been an active research area for several decades, with original works dating back to the end of the 80s. Yet, until now many basic problems remain ...

Assoc Computing Machinery2024

Type-Preserving Compilation of Class-Based Languages

Guillaume André Fradji Martres

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

Between the Pattern and the Type: A short parallel story

Vasileios Chanis

Historically speaking, the notion of the type was reintroduced to the larger architectural discourse as a direct consequence of the crisis of the Modern. The task of revisiting the forms of the past also dictated the return of architectural methods that ha ...

2023

A Theory of Value for Service Ecosystems

Blagovesta Hristova Kostova

In this thesis, we present a theory of value for the design and analysis of service ecosystems. The theory is based on general systems thinking. The concept of a system is used for relating knowledge from different disciplines (such as software engineering ...

EPFL2022

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

Quantum yield and brightness

Jean-Claude Bünzli

Brightness has different meaning in different contexts and some of these are reviewed. The scientific definition of brightness does not represent our perception. The current definition is that from the IUPAC Gold Book and is mainly restricted to solutions. ...

2020

Atomistic modeling of the solid-liquid interface of metals and alloys

Edoardo Baldi

Solidification is a phase transformation of utmost importance in material science, for it largely controls materials' microstructure on which a wide range of mechanical properties depends. Almost every human artifact undergoes a transformation that leads t ...

EPFL2020

Benchmarking Agility For Multilegged Terrestrial Robots

Auke Ijspeert, Peter Eckert

In this paper, we present a novel and practical approach for benchmarking agility. We focus on terrestrial, multilegged locomotion in the field of bio-inspired robotics. We define agility as the ability to perform a set of different but specific tasks exec ...

2019

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

Type Soundness Proofs with Definitional Interpreters

Tiark Rompf, Nada Amin

While type soundness proofs are taught in every graduate PL class, the gap between realistic languages and what is accessible to formal proofs is large. In the case of Scala, it has been shown that its formal model, the Dependent Object Types (DOT) calculu ...

Assoc Computing Machinery2017

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

The Essence of Dependent Object Types

Martin Odersky, Tiark Rompf, Nada Amin, Sandro Stucki, Karl Samuel Grütter

Focusing on path-dependent types, the paper develops foundations for Scala from first principles. Starting from a simple calculus D-

Springer International Publishing2016

Roadmap on optical rogue waves and extreme events

The pioneering paper 'Optical rogue waves' by Solli et al (2007 Nature 450 1054) started the new subfield in optics. This work launched a great deal of activity on this novel subject. As a result, the initial concept has expanded and has been enriched by n ...

Iop Publishing Ltd2016

Named Entity Resources - Overview and Outlook

Maud Ehrmann

Recognition of real-world entities is crucial for most NLP applications. Since its introduction some twenty years ago, named entity processing has undergone a significant evolution with, among others, the definition of new tasks (e.g. entity linking) and t ...

European Language Resources Association (ELRA)2016

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

Bivariate Matrix Functions

Daniel Kressner

A definition of bivariate matrix functions is introduced and some theoretical as well as algorithmic aspects are analyzed. It is shown that our framework naturally extends the usual notion of (univariate) matrix functions and allows to unify existing resul ...

Element2014

Defining the potential of usable waste heat in industrial processes with the help of pinch and exergy analysis

François Maréchal, Daniel Favrat, Matthias Bendig

This paper aims at giving a definition for waste heat in analogy to the definitions of natural resources and reserves. It aims also at presenting a method for identifying, characterizing and quantifying the available waste heat of an industrial system that ...

Czech Society of Chemical Engineering and Italian Association of Chemical Engineering2012

Towards a Theory of Glue

Simon Bliudze

We propose and study the notions of behaviour type and composition operator making a first step towards the definition of a formal framework for studying behaviour composition in a setting sufficiently general to provide insight into how the component-base ...

2012