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 month
Alternatives and similar repositories for nlambda
Users that are interested in nlambda are comparing it to the libraries listed below
Sorting:
- Library of categories, with categorical constructions on them☆59Updated 2 years ago
- ☆45Updated 6 years ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- Sort any Traversable container☆42Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 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
- A simple GUI for Agda☆31Updated 10 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Agda programming with holes☆28Updated 5 years ago
- Formalization of Mathematics using Type Theory of Agda Programming Language☆11Updated 8 years ago
- being the scrapings of my stackoverflow answers☆48Updated 6 years ago
- Haskell library implementing "Data Types a la Carte"☆92Updated 2 years ago
- constraint level if statements☆117Updated 8 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆84Updated 2 weeks ago
- A Haskell library for open records and variants using closed type families and type literals☆112Updated 3 years ago
- Type Your Matrices For Great Good☆29Updated 5 years ago
- An approach to higher algebra in type theory☆23Updated 5 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Constrained versions of the Haskell standard category-theory-based type classes, using ConstraintKinds☆22Updated 2 years ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆15Updated 7 years ago
- Cofun with Cofree Comonads☆32Updated 9 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- A library for doing generic programming in Agda☆36Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated 2 weeks ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 7 years ago
- Strongly-typed System F in Haskell☆120Updated 3 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- materials for ESSLLI 2015 course: Monads and Natural Language☆26Updated 10 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆104Updated 5 months ago
- what I did on my holidays☆12Updated 7 years ago