Blog
-
[]
Type Systems #25: The Lambda Iceberg and Lambda Cube
-
[]
Type Systems #24: The Calculus of Constructions and Dependent Types
-
[]
Type Systems #23: The Curry-Howard Isomorphism
-
[]
Type Systems #22: Zippers and One-Hole Contexts
-
[]
Type Systems #21: Algebraic Data Types
-
[]
Type Systems #20: An Equivalence between Types
-
[]
Type Systems #19: System Fωω..? A Recap of Type Systems
-
[]
Type Systems #18: Higher-Kinded Types
-
[]
Type Systems #17: System Fω, and Kinds
-
[]
Type Systems #16: Functions... on Types?
-
[]
Type Systems #15: A Church Encoding of Lists
-
[]
Type Systems #14: System F<:, Tops and Bottoms
-
[]
Type Systems #13: The Typescript Lattice
-
[]
Type Systems #12: Subtyping
-
[]
Type Systems #11: Existential Quantification
-
[]
Type Systems #10: Universal Quantification and Rank-N Types
-
[]
Type Systems #9: BTW: Continuation-Passing Style
-
[]
Type Systems #8: Theorems for Free!
-
[]
Type Systems #7: Using Generics
-
[]
Type Systems #1.6: Currying
-
[]
Type Systems #5: Polymorphism and System F
-
[]
Type Systems #4: STLC is not enough!
-
[]
Type Systems #3: Simply Typed Lambda Calculus
-
[]
Type Systems #2: Untyped Lambda Calculus, again
-
[]
Type Systems #1: Untyped Lambda Calculus
-
[]
Will AI lead to a Haskell resurgence?
-
[]
Category theory is hilariously recursive
-
[]
-
[]
Please just give me a programming language man
-
[]
-
[]
Angular and Greenspun's Tenth Rule
-
[]
-
[]
-
[]
Constructors shouldn't throw
-
[]
-
[]
-
[]
Free objects #3 - Magmas & Binary Finger Trees
-
[]
Pipeline runs grow n² with the number of open PRs
-
[]
Free objects #2 - Monoids & Lists
-
[]
Enforcing Architecture through Ceremony
-
[]
Free objects #1 - Commutative Monoids & Multisets
-
[]
prefixed/compound ids are kinda neat
-
[]
Please walk on the right half of the sidewalk
-
[]
Typescript Hacks #1: String suggestions
-
[]
Create OpenShift clusters for testing (in Azure, and locally)