System F in Agda with well-scoped de Bruijn indices
-
Updated
Mar 12, 2024 - Agda
System F in Agda with well-scoped de Bruijn indices
A type inference algorithm for SystemF/polymorphic lambda calculus (undecidable problem) and an experimental playground for methods based on the higher-order unification for type inference and type checking of formal systems defined by the lambda cube concept.
Add a description, image, and links to the systemf topic page so that developers can more easily learn about it.
To associate your repository with the systemf topic, visit your repo's landing page and select "manage topics."