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

Concept

Liskov substitution principle

Related publications (13)

Formal Foundations of Capture Tracking

Aleksander Slawomir Boruch-Gruszecki

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

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

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

Stoic: Towards Disciplined Capabilities

Martin Odersky, Nada Amin, Sandro Stucki, Fengyun Liu, Paolo Giosuè Giarrusso

Capabilities are widely used in the design of software systems to ensure security. A system of capabilities can become a mess in the presence of objects and functions: objects may leak capabilities and functions may capture capabilities. They make reasonin ...

2020

A hierarchical preconditioner for wave problems in quasilinear complexity

Jan Sickmann Hesthaven, Boris Bonev

The paper introduces a novel, hierarchical preconditioner based on nested dissection and hierarchical matrix compression. The preconditioner is intended for continuous and discontinuous Galerkin formulations of elliptic problems. We exploit the property th ...

2022

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

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

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

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

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

Object-oriented pattern matching

Burak Emir

Pattern matching is a programming language construct considered essential in functional programming. Its purpose is to inspect and decompose data. Instead, object-oriented programming languages do not have a dedicated construct for this purpose. A possible ...

EPFL2007

Flexible subtyping relations for component-oriented formalisms and their verification

David Huerzeler

In this thesis we address the problem of safe substitutability in mobile component-oriented formalisms. We try to give a solution for different definitions of "safe" through a new notion of subtyping based on flexibility and observation. The aim is to have ...

EPFL2004

Related publications (13)

Formal Foundations of Capture Tracking

Aleksander Slawomir Boruch-Gruszecki

EPFL2024

Type-Preserving Compilation of Class-Based Languages

Guillaume André Fradji Martres

EPFL2023

Type-Level Programming with Match Types

Martin Odersky, Olivier Eric Paul Blanvillain

ASSOC COMPUTING MACHINERY2022

Stoic: Towards Disciplined Capabilities

Martin Odersky, Nada Amin, Sandro Stucki, Fengyun Liu, Paolo Giosuè Giarrusso

2020

A hierarchical preconditioner for wave problems in quasilinear complexity

Jan Sickmann Hesthaven, Boris Bonev

2022

Type Soundness Proofs with Definitional Interpreters

Tiark Rompf, Nada Amin

Assoc Computing Machinery2017

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

Type Soundness for Dependent Object Types (DOT)

Tiark Rompf, Nada Amin

Assoc Computing Machinery2016

Type Soundness for Dependent Object Types

Tiark Rompf, Nada Amin

2016

Dependent Object Types

Nada Amin

EPFL2016

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

Object-oriented pattern matching

Burak Emir

EPFL2007

Flexible subtyping relations for component-oriented formalisms and their verification

David Huerzeler

EPFL2004