Media Summary: In the course of writing I wanted to write a TupleN# operator that takes ... This video is a continuation of last week's ( where I actually get to levity- I build a version of zipWith that can infer its

Rae Implementing An Arity Polymorphic - Detailed Analysis & Overview

In the course of writing I wanted to write a TupleN# operator that takes ... This video is a continuation of last week's ( where I actually get to levity- I build a version of zipWith that can infer its I explore the real definition of IO, and how it's just a fairly ordinary state monad. The only unusual aspect is that the state it passes ... We like to think of Haskell as being order-independent: no matter what order you put your declarations in, your program means ... I introduce the new ImpredicativeTypes extension and show a way to use it to make indexing into binary trees convenient. Code at ...

In this broadcast of my talk at the Haskell Implementors' Workshop, I describe how GHC infers a generalized type for definitions ... Inspired by I walk through an example of how UndecidableInstances might ... In the start of optimizing my Wordle analyzer, I establish a "lab notebook" for optimizations and then overload a function to achieve ... Spurred on by I discuss how GHC currently is pretty arbitrary in when it decides to ...

Photo Gallery

@rae: Implementing an arity-polymorphic unboxed tuple operator
@rae: Levity polymorphism (for real)
@rae: Impredicative types and dynamic types -- useful in parsing JSON
@rae: Inferring the arity of zipWith, with lots of type-level hackery
@rae: Why -XNoPolyKinds should be removed from Haskell
@rae: Unboxed types in GHC
@rae: IO is just the state monad passing the real world
@rae: The monomorphism restriction in Haskell causes order dependency. Ack!
@rae: A not-so-quick look at Quick Look impredicativity
@rae: Generalization is hard, but somebody's got to do it
@rae: UndecidableInstances can actually cause a runtime loop. Eek!
@rae: Wordle #9: Optimization setup and method overloading
View Detailed Profile
@rae: Implementing an arity-polymorphic unboxed tuple operator

@rae: Implementing an arity-polymorphic unboxed tuple operator

In the course of writing https://github.com/ghc-proposals/ghc-proposals/pull/475, I wanted to write a TupleN# operator that takes ...

@rae: Levity polymorphism (for real)

@rae: Levity polymorphism (for real)

This video is a continuation of last week's (https://youtu.be/Mb_B-j8ePfc) where I actually get to levity-

@rae: Impredicative types and dynamic types -- useful in parsing JSON

@rae: Impredicative types and dynamic types -- useful in parsing JSON

I demonstrate how

@rae: Inferring the arity of zipWith, with lots of type-level hackery

@rae: Inferring the arity of zipWith, with lots of type-level hackery

I build a version of zipWith that can infer its

@rae: Why -XNoPolyKinds should be removed from Haskell

@rae: Why -XNoPolyKinds should be removed from Haskell

I explain why I view the lack of kind

@rae: Unboxed types in GHC

@rae: Unboxed types in GHC

I run through a toy example of how

@rae: IO is just the state monad passing the real world

@rae: IO is just the state monad passing the real world

I explore the real definition of IO, and how it's just a fairly ordinary state monad. The only unusual aspect is that the state it passes ...

@rae: The monomorphism restriction in Haskell causes order dependency. Ack!

@rae: The monomorphism restriction in Haskell causes order dependency. Ack!

We like to think of Haskell as being order-independent: no matter what order you put your declarations in, your program means ...

@rae: A not-so-quick look at Quick Look impredicativity

@rae: A not-so-quick look at Quick Look impredicativity

I introduce the new ImpredicativeTypes extension and show a way to use it to make indexing into binary trees convenient. Code at ...

@rae: Generalization is hard, but somebody's got to do it

@rae: Generalization is hard, but somebody's got to do it

In this broadcast of my talk at the Haskell Implementors' Workshop, I describe how GHC infers a generalized type for definitions ...

@rae: UndecidableInstances can actually cause a runtime loop. Eek!

@rae: UndecidableInstances can actually cause a runtime loop. Eek!

Inspired by https://gitlab.haskell.org/ghc/ghc/-/issues/20666, I walk through an example of how UndecidableInstances might ...

@rae: Wordle #9: Optimization setup and method overloading

@rae: Wordle #9: Optimization setup and method overloading

In the start of optimizing my Wordle analyzer, I establish a "lab notebook" for optimizations and then overload a function to achieve ...

@rae: GHC defaults type representations at pretty arbitrary places

@rae: GHC defaults type representations at pretty arbitrary places

Spurred on by https://gitlab.haskell.org/ghc/ghc/-/issues/20686, I discuss how GHC currently is pretty arbitrary in when it decides to ...