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 10 months ago
Alternatives and similar repositories for nlambda
Users that are interested in nlambda are comparing it to the libraries listed below
Sorting:
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Library of categories, with categorical constructions on them☆57Updated 2 years ago
- Sort any Traversable container☆41Updated 3 years ago
- Type Your Matrices For Great Good☆29Updated 5 years ago
- Conway's game of life in 100 lines or less!☆35Updated 8 years ago
- Many-dimensional type-safe numeric ops☆46Updated 3 years ago
- Cofun with Cofree Comonads☆32Updated 9 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Constrained versions of the Haskell standard category-theory-based type classes, using ConstraintKinds☆22Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- constraint level if statements☆117Updated 7 years ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- First-class type families☆88Updated last month
- 📤 defer instance resolution until runtime☆18Updated 5 years ago
- Generic random generators☆81Updated 2 years ago
- Paper and talk☆55Updated 2 years ago
- "Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct)☆40Updated 10 years ago
- Moved to Haskell.org GitLab.☆61Updated 3 months ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- Proposed changes to Haskell Core Libraries☆19Updated 5 years ago
- A suite of Haskell libraries for representing, manipulating, and sampling random variables☆43Updated last year
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Signature inference for Functional Property Discovery in Haskell☆38Updated 8 years ago
- Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)☆161Updated 4 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- ☆21Updated 3 years ago
- Haskell bindings to the Graphviz toolkit☆64Updated 2 years ago
- Functions and newtype wrappers for traversing Trees☆30Updated last year