szynwelski / nlambda
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.
☆12Updated 5 months ago
Alternatives and similar repositories for nlambda:
Users that are interested in nlambda are comparing it to the libraries listed below
- Constrained versions of the Haskell standard category-theory-based type classes, using ConstraintKinds☆22Updated last year
- An example of back-propagation implemented in Haskell.☆26Updated 10 years ago
- Library of categories, with categorical constructions on them☆56Updated last year
- ☆45Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Generic random generators☆81Updated 2 years ago
- Where my everyday research happens☆52Updated 2 weeks ago
- A suite of Haskell libraries for representing, manipulating, and sampling random variables☆42Updated last year
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Type Your Matrices For Great Good☆30Updated 4 years ago
- A simple GUI for Agda☆31Updated 9 years ago
- constraint level if statements☆111Updated 7 years ago
- Categorical logic from a categorical point of view☆78Updated last year
- 15-819 (Homotopy Type Theory) Lecture Notes☆14Updated 7 years ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- First-class type families☆87Updated 7 months ago
- A place to collect work on dialectica categories.☆26Updated 2 months ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- what I did on my holidays☆12Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Monad Transformers and Classes☆77Updated 5 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆53Updated 2 years ago
- Purely functional data structures in Idris☆10Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- ☆10Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago