Publication

Type-Level Programming with Match Types

Martin Odersky, Olivier Eric Paul Blanvillain
2022
Journal Articles

Abstract

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, a type-level equivalent of pattern matching. Match types integrate seamlessly into programming languages with subtyping and, despite their simplicity, offer significant additional expressiveness. We formalize the feature of match types in a calculus based on System F-

Official source

https://infoscience.epfl.ch/entities/publication/7bdcbac2-e5e2-4fe3-9e23-0681b0f9a096

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.

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.

Type-Level Programming with Match Types

Chat with Graph Search

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