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

Publication

The Essence of Dependent Object Types

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

Abstract

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

Official source

https://infoscience.epfl.ch/entities/publication/6c6bb09d-a41c-46e8-aac4-d059cc8a6459

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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

Abstract

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

Official source

https://infoscience.epfl.ch/entities/publication/6c6bb09d-a41c-46e8-aac4-d059cc8a6459

About this result

Related concepts (27)

Subtyping

In programming language theory, subtyping (also subtype polymorphism or inclusion polymorphism) is a form of type polymorphism in which a subtype is a datatype that is related to another datatype (the supertype) by some notion of substitutability, meaning that program elements, typically subroutines or functions, written to operate on elements of the supertype can also operate on elements of the subtype. If S is a subtype of T, the subtyping relation (written as S

Intuitionistic type theory

Intuitionistic type theory (also known as constructive type theory, or Martin-Löf type theory) is a type theory and an alternative foundation of mathematics. Intuitionistic type theory was created by Per Martin-Löf, a Swedish mathematician and philosopher, who first published it in 1972. There are multiple versions of the type theory: Martin-Löf proposed both intensional and extensional variants of the theory and early impredicative versions, shown to be inconsistent by Girard's paradox, gave way to predicative versions.

Lambda calculus

Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. It is a universal model of computation that can be used to simulate any Turing machine. It was introduced by the mathematician Alonzo Church in the 1930s as part of his research into the foundations of mathematics. Lambda calculus consists of constructing lambda terms and performing reduction operations on them.

Related publications (23)

The Essence of Dependent Object Types

Graph Chatbot

Formal Foundations of Capture Tracking

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

Degrees of Separation: A Flexible Type System for Safe Concurrency