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 6 months ago
Alternatives and similar repositories for nlambda:
Users that are interested in nlambda are comparing it to the libraries listed below
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- Type Your Matrices For Great Good☆30Updated 4 years ago
- An approach to higher algebra in type theory☆23Updated 4 years ago
- Library of categories, with categorical constructions on them☆56Updated last year
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- ☆45Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Category theory and algebra☆28Updated 8 years ago
- Sort any Traversable container☆41Updated 2 years ago
- A place to collect work on dialectica categories.☆26Updated 3 months ago
- ☆10Updated 8 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Agda programming with holes☆27Updated 4 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Where my everyday research happens☆52Updated last week
- Categorical logic from a categorical point of view☆78Updated last year
- A simple GUI for Agda☆31Updated 9 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Constrained versions of the Haskell standard category-theory-based type classes, using ConstraintKinds☆22Updated last year
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Formalization of Mathematics using Type Theory of Agda Programming Language☆11Updated 7 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 6 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 8 years ago