Concept

Polymorphism (computer science)

Related publications (32)

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

Semantic Shape Editing with Parametric Implicit Templates

Uday Kusupati

We propose a semantic shape editing method to edit 3D triangle meshes using parametric implicit surface templates, benefiting from the many advantages offered by analytical implicit representations, such as infinite resolution and boolean or blending opera ...

2024

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

DFT plus U-type functional derived to explicitly address the flat plane condition

Edward Baxter Linscott

A DFT+U-type corrective functional is derived from first principles to enforce the flat plane condition on localized subspaces, thus dispensing with the need for an ad hoc derivation from the Hubbard model. Small, molecular test systems at the dissociated ...

AMER PHYSICAL SOC2023

A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning

Yichen Xu, Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki

Many programming languages in the OO tradition now support pattern matching in some form. Historical examples include Scala and Ceylon, with the more recent additions of Java, Kotlin, TypeScript, and Flow. But pattern matching on generic class hierarchies ...

New York2022

Type-preserving compilation of (most of) FGJ into DOT

Guillaume André Fradji Martres

2022

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

Type-Level Programming with Match Types

Martin Odersky, Olivier Eric Paul Blanvillain, Jonathan Immanuel Brachthäuser

2021

Does scaling player size skew one’s ability to correctly evaluate object sizes in a virtual environment?

Ronan Boulic, Bruno Herbelin, Mathias Guy Delahaye

This paper presents the results of a study performed in order to evaluate whether a navigation technique, based on scaling the user’s avatar, impacts the user’s ability to correctly assess the size of virtual objects in a virtual environment. This study wa ...

Association for Computing Machinery2020

Two new polymorphic structures of human full-length alpha-synuclein fibrils solved by cryo-electron microscopy

Henning Paul-Julius Stahlberg, Ricardo Cesar Guerrero Ferreira, Pratibha Kumari

Intracellular inclusions rich in alpha-synuclein are a hallmark of several neuropathological diseases including Parkinson’s disease (PD). Previously, we reported the structure of alpha-synuclein fibrils (residues 1–121), composed of two protofibrils that a ...

2019

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.