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 last month
Related projects ⓘ
Alternatives and complementary repositories for nlambda
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 4 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 7 years ago
- Type Your Matrices For Great Good☆29Updated 4 years ago
- A suite of Haskell libraries for representing, manipulating, and sampling random variables☆42Updated last year
- A place to collect work on dialectica categories.☆25Updated 2 weeks ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Library of categories, with categorical constructions on them☆54Updated last year
- A simple GUI for Agda☆31Updated 8 years ago
- An approach to higher algebra in type theory☆23Updated 4 years ago
- ☆45Updated 5 years ago
- A Haskell library for open records and variants using closed type families and type literals☆111Updated 2 years ago
- Categorical logic from a categorical point of view☆76Updated last year
- Sort any Traversable container☆41Updated 2 years ago
- Cofun with Cofree Comonads☆30Updated 8 years ago
- Organization and planning for the Initial Types Club☆71Updated 2 years ago
- Tactic Metaprogramming in Haskell☆57Updated 5 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- A priliminary backend for Idris that compiles to Clean.☆15Updated 7 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 6 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated 11 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 5 years ago
- An experiment in functional interface design☆23Updated 8 years ago
- Smash products, Wedge products, and other Pointed stuff☆34Updated 2 years ago
- Where my everyday research happens☆53Updated last week
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Purely functional data structures in Idris☆9Updated 7 years ago