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 last year
Alternatives and similar repositories for nlambda
Users that are interested in nlambda are comparing it to the libraries listed below
Sorting:
- Sort any Traversable container☆41Updated 3 years ago
- Type Your Matrices For Great Good☆29Updated 5 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Library of categories, with categorical constructions on them☆58Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Purely functional data structures in Idris☆11Updated 8 years ago
- constraint level if statements☆117Updated 8 years ago
- being the scrapings of my stackoverflow answers☆48Updated 6 years ago
- ☆45Updated 6 years ago
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 6 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
- do-notation for Category and "Arrow without arr"☆62Updated 8 years ago
- Cofun with Cofree Comonads☆32Updated 9 years ago
- Functions and newtype wrappers for traversing Trees☆30Updated last year
- Paper and talk☆55Updated 2 years ago
- First-class type families☆90Updated last month
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- A simple GUI for Agda☆31Updated 10 years ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Where my everyday research happens☆55Updated 3 weeks ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- An approach to higher algebra in type theory☆22Updated 5 years ago
- Constrained versions of the Haskell standard category-theory-based type classes, using ConstraintKinds☆22Updated 2 years ago
- "Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct)☆41Updated 10 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆127Updated last year
- Monad Transformers and Classes☆76Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆43Updated last year