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

Official source

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

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.

Related courses (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 ...

Related lectures (32)

Introduction to Types and Inductive Relations

Explores the significance of types in programming and discusses unsound type systems and inductively defined relations.

Variance: Definition and Typing Rules

Explains variance relationships, typing rules for functions, and variance checks in Scala.

Generics and Subtyping

Covers advanced concepts in generics and subtyping in Java, focusing on LinkedList implementation and List interface.

Related publications (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

Graph Chat

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.

Official source

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

About this result

Related courses (5)

CS-550: Formal verification

CS-320: Computer language processing

BIO-480: Neuroscience: from molecular mechanisms to disease

Related lectures (32)

Introduction to Types and Inductive Relations

Explores the significance of types in programming and discusses unsound type systems and inductively defined relations.

Variance: Definition and Typing Rules

Explains variance relationships, typing rules for functions, and variance checks in Scala.

Generics and Subtyping

Covers advanced concepts in generics and subtyping in Java, focusing on LinkedList implementation and List interface.

Related publications (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

Related people (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

Martin Odersky heads the programming research group at EPFL. His research interests cover fundamental as well as applied aspects of programming languages. They include semantics, type systems, programming language design, and compiler construction. The main focus if his work lies in the integration of object-oriented and functional programming. His research thesis is that the two paradigms are just two sides of the same coin and should be unified as much as possible. To prove this he has experimented a number of language designs, from Pizza to GJ to Functional Nets. He has also influenced the development of Java as a co-designer of Java generics and as the original author of the current javac reference compiler. His current work concentrates on the Scala programming language, which unifies FP and OOP, while staying completely interoperable with Java and .NET. Martin Odersky got his doctorate from ETHZ, in 1989. He held research positions at the IBM T.J. Watson Research Center from 1989 and at Yale University from 1991. He was then a professor at the University of Karlsruhe from 1993 and at the University of South Australia from 1997. He joined EPFL as full professor in 1999. He is associate editor of the Journal of Functional Programming and member of IFIP WG 2.8. He was conference chair for ICFP 2000, and program chair for ECOOP 2004 as well as ETAPS/CC 2007.

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.

Related units (3)

Programming Methods Laboratory 1

Scala - Administration

Distributed Computing Laboratory

Related concepts (16)

Object-oriented programming

Object-Oriented Programming (OOP) is a programming paradigm based on the concept of "objects", which can contain data and code. The data is in the form of fields (often known as attributes or properties), and the code is in the form of procedures (often known as methods). A common feature of objects is that procedures (or methods) are attached to them and can access and modify the object's data fields. In this brand of OOP, there is usually a special name such as or used to refer to the current object.

Polymorphism (computer science)

In programming language theory and type theory, polymorphism is the provision of a single interface to entities of different types or the use of a single symbol to represent multiple different types. The concept is borrowed from a principle in biology where an organism or species can have many different forms or stages. The most commonly recognized major classes of polymorphism are: Ad hoc polymorphism: defines a common interface for an arbitrary set of individually specified types.

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.