My Attempt at System Fω with Row-Polymorphism
-
Updated
Jul 4, 2021 - OCaml
My Attempt at System Fω with Row-Polymorphism
A functional programming language based on system F (omega) ft. NbE and higher order unification
Lambda Calculus implementations in OCaml.
Progamming language based on the system F-omega with polymorphic kinds, (weakly) equirecursive types, general function overloading, type inference, and flexible syntax.
Add a description, image, and links to the system-f-omega topic page so that developers can more easily learn about it.
To associate your repository with the system-f-omega topic, visit your repo's landing page and select "manage topics."