Concept

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

Source officielle

https://en.wikipedia.org/wiki/Subtyping

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Cours associés (5)

CS-550: Formal verification

We introduce formal verification as an approach for developing highly reliable systems. Formal verification finds proofs that computer systems work under all relevant scenarios. We will learn how to use formal verification tools and explain the theory and ...

CS-320: Computer language processing

We teach the fundamental aspects of analyzing and interpreting computer languages, including the techniques to build compilers. You will build a working compiler from an elegant functional language into machine code using a popular backend called LLVM (htt ...

BIO-480: Neuroscience: from molecular mechanisms to disease

The goal of the course is to guide students through the essential aspects of molecular neuroscience and neurodegenerative diseases. The student will gain the ability to dissect the molecular basis of disease in the nervous system in order to begin to under ...

Afficher plus

Séances de cours associées (32)

Introduction aux types et aux relations inductives

Explore l'importance des types dans la programmation et discute des systèmes de types malsains et des relations inductives.

Écart : définition et règles de dactylographie

Explique les relations de variance, les règles de saisie des fonctions et les vérifications de variance dans Scala.

Génériques et sous-typage

Couvre les concepts avancés de génériques et de sous-typage en Java, en se concentrant sur l'implémentation LinkedList et l'interface List.

Afficher plus

Publications associées (5)

Interactive and Automated Reasoning with Orthologic

The use of formal verification for mathematics and software is growing, yet the mainstream adoption of verification systems remains hindered by barriers and inefficiencies. The coNP-completeness of the validity problem for classical propositional logic in particular forces tools to rely on heuristics that either are incomplete or have impractical worst-case complexity. SAT and SMT solvers have proved highly effective in practice, but their integration into proof assistants is difficult, and their opacity ca

EPFL2026

Measuring and Controlling Solution Degeneracy across Task-Trained Recurrent Neural Networks

Task-trained recurrent neural networks (RNNs) are widely used in neuroscience and machine learning to model dynamical computations. To gain mechanistic insight into how neural systems solve tasks, prior work often reverse-engineers individual trained networks. However, different RNNs trained on the same task and achieving similar performance can exhibit strikingly different internal solutions, a phenomenon known as solution degeneracy. Here, we develop a unified framework to systematically quantify and cont

Neural Information Processing Systems Foundation, Inc. (NeurIPS)2025

Mapping the Structural Landscape of Amyloid Fibrils to Guide Polymorph-Specific Therapeutics

Amyloid fibrils are pathological hallmarks of neurodegenerative diseases and central contributors to their progression, representing promising targets for disease-modifying interventions. However, limited access to patient-derived fibrils and the inability to reproduce pathological foldsin vitrohinder the development of fibril-specific ligands. Here, we present FibrilSite, a computational pipeline that identifies geometric and physicochemical similarities across fibril surfaces and demonstrate its utility t

bioRxiv2025

Afficher plus

Graph Chat

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Source officielle

https://en.wikipedia.org/wiki/Subtyping

À propos de ce résultat

Cours associés (5)

CS-550: Formal verification

CS-320: Computer language processing

BIO-480: Neuroscience: from molecular mechanisms to disease

Afficher plus

Séances de cours associées (32)

Introduction aux types et aux relations inductives

Explore l'importance des types dans la programmation et discute des systèmes de types malsains et des relations inductives.

Écart : définition et règles de dactylographie

Explique les relations de variance, les règles de saisie des fonctions et les vérifications de variance dans Scala.

Génériques et sous-typage

Couvre les concepts avancés de génériques et de sous-typage en Java, en se concentrant sur l'implémentation LinkedList et l'interface List.

Afficher plus

Publications associées (5)

Interactive and Automated Reasoning with Orthologic

EPFL2026

Measuring and Controlling Solution Degeneracy across Task-Trained Recurrent Neural Networks

Neural Information Processing Systems Foundation, Inc. (NeurIPS)2025

Mapping the Structural Landscape of Amyloid Fibrils to Guide Polymorph-Specific Therapeutics

bioRxiv2025

Afficher plus

Personnes associées (6)

Viktor Kuncak

Viktor Kunčak joined EPFL in 2007, after receiving a PhD degree from MIT. Since then has been leading the Laboratory for Automated Reasoning and Analysis and supervised at least 12 completed PhD theses. His works on languages, algorithms and systems for verification and automated reasoning. He served as an initiator and one of the coordinators of a European network (COST action) in the area of automated reasoning, verification, and synthesis. In 2012 he received a 5-year single-investigator European Research Council (ERC) grant of 1.5M EUR. His invited talks include those at Lambda Days, Scala Days, NFM, LOPSTR, SYNT, ICALP, CSL, RV, VMCAI, and SMT. A paper on test generation he co-authored received an ACM SIGSOFT distinguished paper award at ICSE. A PLDI paper he co-authored was published in the Communications of the ACM as a Research Highlight article. His Google Scholar profile reports an over-approximate H-index of 38. He was an associate editor of ACM Transactions on Programming Languages and Systems (TOPLAS) and served as a co-chair of conferences on Computer-Aided Verification (CAV), Formal Methods in Computer Aided Design (FMCAD), Workshop on Synthesis (SYNT), and Verification, Model Checking, and Abstract Interpretation (VMCAI). At EPFL he teaches courses on functional and parallel programming, compilers, and verification. He has co-taught the MOOC "Parallel Programming" that was visited by over 100'000 learners and completed by thousands of students from all over the world.

Yichen Xu

Martin Odersky

Enseignement et PhD Doctorant·es actuel·les Matthieu Bovel, Yaoyu Zhao, Anna Herlihy, Nguyên Cao Pham, Yichen Xu A dirigé les thèses EPFL de Julie Vachon, Matthias Zenger, Michel Schinz, Philippe Altherr, Vincent Cremet, Burak Emir, Stéphane Micheloud, Iulian Dragos, Philipp Haller, Gilles Dubochet, Tiark Rompf, Ingo Maier, Lukas Rytz, Aleksandar Prokopec, Heather Miller, Vlad Ureche, Nada Amin, Manohar Jonnalagedda, Hubert Plociniczak, Vojin Jovanovic, Sandro Stucki, Eugene Burmako, Dmytro Petrashko, Séb

Rodrigo Raya

Dimitri Racordon

Expertise Programming language design, type systems, memory safety I got my Ph.D. in computer science at the University of Geneva, Switzerland. I worked on model checking and developed efficient data structures to generate and explore large state spaces. SI then studied logics and type systems while trying to find new ways to teach computer science.I have always loved coding, but quickly realized I'm not so good at writing correct programs. So I thought I'd better write clever compilers to do it for me. Eve

Karen Scrivener

De nationalité anglaise, Karen Scrivener est née en 1958. Au cours de sa carrière, ses travaux et sa recherche traitaient des domaines suivants: Identification du développement microstucturale pendant l'hydratation du ciment. Elaboration d'une approche multitechnique pour étudier la microstucture des ciments et bétons, avec accent sur la quantification par analyse des images d'électrons retrodiffusés. Caractérisation de l'auréole de transition de la pâte de ciment autour des granulats. Compréhension des processus de dégardation des bétons, en particulier le gonflement lié à la formation de l'éttringite retardée dans les bétons étuvés.

Unités associées (3)

Laboratoire de méthodes de programmation 1

Scala - Gestion

Laboratoire de calcul distribué

Concepts associés (16)

Programmation orientée objet

La programmation orientée objet (POO), ou programmation par objet, est un paradigme de programmation informatique. Elle consiste en la définition et l'interaction de briques logicielles appelées objets ; un objet représente un concept, une idée ou toute entité du monde physique, comme une voiture, une personne ou encore une page d'un livre. Il possède une structure interne et un comportement, et il sait interagir avec ses pairs.

Polymorphisme (informatique)

En informatique et en théorie des types, le polymorphisme, du grec ancien polús (plusieurs) et morphê (forme), est le concept consistant à fournir une interface unique à des entités pouvant avoir différents types. Par exemple, des opérations telles que la multiplication peuvent ainsi être étendues à des scalaires aux vecteurs ou aux matrices, l'addition, des scalaires aux fonctions ou aux chaînes de caractères, etc.

Parametric polymorphism

In programming languages and type theory, parametric polymorphism allows a single piece of code to be given a "generic" type, using variables in place of actual types, and then instantiated with particular types as needed. Parametrically polymorphic functions and data types are sometimes called generic functions and generic datatypes, respectively, and they form the basis of generic programming. Parametric polymorphism may be contrasted with ad hoc polymorphism.

Afficher plus

Personnes associées (6)