Personal research notes
dependent-types functional-programming proof-assistant type-theory cubical-type-theory programming-languages term-rewriting nominal-set homotopy-type-theory
- Updated
Oct 18, 2024 - Coq
Personal research notes
Nλ is a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of all intervals with rational endpoints.
Simply-typed lambda calculus and extensions: termination, extrinsic/intrinsic representations, nominal binding techniques
Add a description, image, and links to the nominal-set topic page so that developers can more easily learn about it.
To associate your repository with the nominal-set topic, visit your repo's landing page and select "manage topics."