szynwelski / nlambdaLinks
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 9 months ago
Alternatives and similar repositories for nlambda
Users that are interested in nlambda are comparing it to the libraries listed below
Sorting:
- Type Your Matrices For Great Good☆29Updated 5 years ago
- Sort any Traversable container☆41Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- Library of categories, with categorical constructions on them☆57Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- ☆21Updated 3 years ago
- Many-dimensional type-safe numeric ops☆46Updated 3 years ago
- ☆45Updated 6 years ago
- Wailing into the primordial ooze of category theory☆55Updated 2 months ago
- Constrained versions of the Haskell standard category-theory-based type classes, using ConstraintKinds☆22Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- A place to collect work on dialectica categories.☆26Updated last week
- Generic random generators☆81Updated 2 years ago
- First-class type families☆88Updated 2 months ago
- Formalization of Mathematics using Type Theory of Agda Programming Language☆11Updated 7 years ago
- Provides a type-safe way of working with permutations in Idris☆36Updated 3 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆54Updated 3 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆25Updated this week
- Paper and talk☆54Updated 2 years ago
- Reimplementation of Parsley in Haskell, with improvements☆56Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 10 months ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- "Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct)☆40Updated 9 years ago
- Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)☆162Updated 4 years ago
- An approach to higher algebra in type theory☆23Updated 5 years ago