Media Summary: How to infer the type of `if` expressions in HM Achieving polymorphism for `let` expressions in HM How to add inference of `let` expressions to HM

Finishing Type Inference Ocaml Programming - Detailed Analysis & Overview

How to infer the type of `if` expressions in HM Achieving polymorphism for `let` expressions in HM How to add inference of `let` expressions to HM How to infer the type of anonymous functions (lambdas) in HM A "closure" is a data structure containing the code for a function, as well as the environment that "closes" off its free variables. How to infer the type of function applications in HM

Photo Gallery

Finishing Type Inference | OCaml Programming | Chapter 9 Video 46
Inference of Ifs | OCaml Programming | Chapter 9 Video 40
Type Inference Relation | OCaml Programming | Chapter 9 Video 38
A Worked Example of Type Inference | OCaml Programming | Chapter 9 Video 45
Hindley-Milner Type Inference | OCaml Programming | Chapter 9 Video 37
Let Polymorphism | OCaml Programming | Chapter 9 Video 48
Naive Inference of Let | OCaml Programming | Chapter 9 Video 47
Inference of Functions | OCaml Programming | Chapter 9 Video 41
Closures | OCaml Programming | Chapter 9 Video 27
Inference of Applications | OCaml Programming | Chapter 9 Video 42
SimPL Type System | OCaml Programming | Chapter 9 Video 32
[WITS'25] Invited Talk: Type inference in OCaml and GHC using Levels
View Detailed Profile
Finishing Type Inference | OCaml Programming | Chapter 9 Video 46

Finishing Type Inference | OCaml Programming | Chapter 9 Video 46

What happens when HM

Inference of Ifs | OCaml Programming | Chapter 9 Video 40

Inference of Ifs | OCaml Programming | Chapter 9 Video 40

How to infer the type of `if` expressions in HM

Type Inference Relation | OCaml Programming | Chapter 9 Video 38

Type Inference Relation | OCaml Programming | Chapter 9 Video 38

The HM

A Worked Example of Type Inference | OCaml Programming | Chapter 9 Video 45

A Worked Example of Type Inference | OCaml Programming | Chapter 9 Video 45

Putting together the entire HM

Hindley-Milner Type Inference | OCaml Programming | Chapter 9 Video 37

Hindley-Milner Type Inference | OCaml Programming | Chapter 9 Video 37

The Hindley-Milner

Let Polymorphism | OCaml Programming | Chapter 9 Video 48

Let Polymorphism | OCaml Programming | Chapter 9 Video 48

Achieving polymorphism for `let` expressions in HM

Naive Inference of Let | OCaml Programming | Chapter 9 Video 47

Naive Inference of Let | OCaml Programming | Chapter 9 Video 47

How to add inference of `let` expressions to HM

Inference of Functions | OCaml Programming | Chapter 9 Video 41

Inference of Functions | OCaml Programming | Chapter 9 Video 41

How to infer the type of anonymous functions (lambdas) in HM

Closures | OCaml Programming | Chapter 9 Video 27

Closures | OCaml Programming | Chapter 9 Video 27

A "closure" is a data structure containing the code for a function, as well as the environment that "closes" off its free variables.

Inference of Applications | OCaml Programming | Chapter 9 Video 42

Inference of Applications | OCaml Programming | Chapter 9 Video 42

How to infer the type of function applications in HM

SimPL Type System | OCaml Programming | Chapter 9 Video 32

SimPL Type System | OCaml Programming | Chapter 9 Video 32

Defining the

[WITS'25] Invited Talk: Type inference in OCaml and GHC using Levels

[WITS'25] Invited Talk: Type inference in OCaml and GHC using Levels

Invited Talk:

Intuition for Unification | OCaml Programming | Chapter 9 Video 43

Intuition for Unification | OCaml Programming | Chapter 9 Video 43

After HM