Compiler Engineering for Substructural Languages I: Day Convolution for Covers
Lets define some combinators
Some personal notes turned into a blog
Latest posts
Compiler Engineering for Substructural Languages I: The Problem with Polymorphism
Can a correct-by-construction implementation of a substructural language be extended to a polymorphic lambda calculus?
Well-Typed Substructural Languages
Implementing well-typed by construction substructural languages
Introduction to Recursion Schemes with Idris
Refactoring Algebraic Datatypes with Recursion Schemes
From Lambda Calculus to Bicartesian Closed Categories
Converting the simply typed lambda calculus into typed combinators
Lambda Calculus and Bicartesian Closed Categories
Defining a typed combinator syntax, and compile it to an arbitrary Bicartesian Closed Category