Lecture

Dependent Types in Programming Languages

Description

This lecture covers different kinds of maps, type operators, equivalence of types, first-class type operators, System Fw syntax and semantics, type equivalence, the calculus of constructions, pure type systems, the lambda cube, dependent types in Coq, type universes in Coq, inductive definitions and recursion in Coq, Curry-Howard correspondence, and the equivalence between LEM and DNE. It also discusses the problem with type checking in programming languages and the adoption of dependent types in Scala and Haskell.

Official source

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 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.