Code for "Learning nominal automata"
-
Updated
Jul 12, 2023 - Haskell
Code for "Learning nominal automata"
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.
Add a description, image, and links to the nlambda topic page so that developers can more easily learn about it.
To associate your repository with the nlambda topic, visit your repo's landing page and select "manage topics."