Data types | Type theory

Kind (type theory)

In the area of mathematical logic and computer science known as type theory, a kind is the type of a type constructor or, less commonly, the type of a higher-order type operator. A kind system is essentially a simply typed lambda calculus "one level up", endowed with a primitive type, denoted and called "type", which is the kind of any data type which does not need any type parameters. A kind is sometimes confusingly described as the "type of a (data) type", but it is actually more of an arity specifier. Syntactically, it is natural to consider polymorphic types to be type constructors, thus non-polymorphic types to be nullary type constructors. But all nullary constructors, thus all monomorphic types, have the same, simplest kind; namely . Since higher-order type operators are uncommon in programming languages, in most programming practice, kinds are used to distinguish between data types and the types of constructors which are used to implement parametric polymorphism. Kinds appear, either explicitly or implicitly, in languages whose type systems account for parametric polymorphism in a programatically accessible way, such as C++, Haskell and Scala. (Wikipedia).

Video thumbnail

On the Setoid Model of Type Theory - Erik Palmgren

Erik Palmgren University of Stockholm October 18, 2012 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Natural Models of Type Theory - Steve Awodey

Steve Awodey Carnegie Mellon University; Member, School of Mathematics March 28, 2013 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

David McAllester - Dependent Type Theory from the Perspective of Mathematics, Physics, and (...)

Dependent type theory imposes a type system on Zemelo-Fraenkel set theory (ZFC). From a mathematics and physics perspective dependent type theory naturally generalizes the Bourbaki notion of structure and provides a universal notion of isomorphism and symmetry. This comes with a universal

From playlist Mikefest: A conference in honor of Michael Douglas' 60th birthday

Video thumbnail

Functional Programming: Type Systems

What comes to your mind when you hear the word "type"? Do you think of an integer or string? Do you think of an object type from your favorite OOP language? Do you think about never ending religious debates regarding static vs dynamic types? Do you realize that these things hardly scratch

From playlist Functional Programming

Video thumbnail

Bas Spitters: Modal Dependent Type Theory and the Cubical Model

The lecture was held within the framework of the Hausdorff Trimester Program: Types, Sets and Constructions. Abstract: In recent years we have seen several new models of dependent type theory extended with some form of modal necessity operator, including nominal type theory, guarded and c

From playlist Workshop: "Types, Homotopy, Type theory, and Verification"

Video thumbnail

Category Theory 2.1: Functions, epimorphisms

Functions, epimorphisms

From playlist Category Theory

Video thumbnail

Value Your Types!

You’re probably familiar with types in programming languages, such as “integer” or “list of integers.” But what if your type system were powerful enough to express types like “non-negative integer” or “list of strings where each string is at least eight characters long”? Welcome to the wor

From playlist Software Development

Video thumbnail

Univalent Foundations Seminar - Steve Awodey

Steve Awodey Carnegie Mellon University; Member, School of Mathematics November 19, 2012 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Type theory and formalization of mathematics - Anders Mörtberg

Short Talks by Postdoctoral Members Anders Mörtberg - September 28, 2015 http://www.math.ias.edu/calendar/event/88254/1443464100/1443465000 More videos on http://video.ias.edu

From playlist Short Talks by Postdoctoral Members

Video thumbnail

Tests, Games, and Martin-Lof's Meaning Explanations for Intuitionistic Type Theory - Peter Dybjer

Peter Dybjer November 30, 2012 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Homotopy Group - (1)Dan Licata, (2)Guillaume Brunerie, (3)Peter Lumsdaine

(1)Carnegie Mellon Univ.; Member, School of Math, (2)School of Math., IAS, (3)Dalhousie Univ.; Member, School of Math April 11, 2013 In this general survey talk, we will describe an approach to doing homotopy theory within Univalent Foundations. Whereas classical homotopy theory may be des

From playlist Mathematics

Video thumbnail

Steve Awodey: Type theories and polynomial monads​

Abstract: A system of dependent type theory T gives rise to a natural transformation p : Terms → Types of presheaves on the category Ctx of contexts, termed a "natural model of T". This map p in turn determines a polynomial endofunctor P : Ctxˆ → Ctxˆ on the category of all presheaves. It

From playlist Topology

Video thumbnail

Directed Type Theory Warren - Michael Warren

Michael Warren Dalhousie University; Member, School of Mathematics April 10, 2013 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Univalence from a computer science point-of-view - Dan Licata

Vladimir Voevodsky Memorial Conference Topic: Univalence from a computer science point-of-view Speaker: Dan Licata Affiliation: Wesleyan University Date: September 14, 2018 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Egbert Rijke: Daily applications of the univalence axiom - lecture 1

HYBRID EVENT Recorded during the meeting "Logic and Interactions" the February 21, 2022 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual M

From playlist Combinatorics

Video thumbnail

On Voevodsky's univalence principle - André Joyal

Vladimir Voevodsky Memorial Conference Topic: On Voevodsky's univalence principle Speaker: André Joyal Affiliation: Université du Québec á Montréal Date: September 11, 2018 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

A Computer-Checked Proof that the Fundamental Group of the Circle is the Integers - Daniel Licata

Daniel Licata Carnegie Mellon University; Member, School of Mathematics November 26, 2012 This talk is designed for a general mathematical audience; no prior knowledge of type theory is presumed. One of the main goals for the special year on univalent foundations is the development of a l

From playlist Mathematics

Video thumbnail

Type Systems I - Vladimir Voevodsky

Vladimir Voevodsky Institute for Advanced Study November 28, 2012 For more videos, visit http://video.ias.edu

From playlist Mathematics

Related pages

Type class | Data type | Parametric polymorphism | Pure type system | Scala (programming language) | Function type | Mathematical logic | Simply typed lambda calculus | Tuple | Type constructor | Type theory | Unary function | Arity | Currying