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 8 months ago
Alternatives and similar repositories for nlambda
Users that are interested in nlambda are comparing it to the libraries listed below
Sorting:
- Type Your Matrices For Great Good☆29Updated 4 years ago
- Formalization of Linear Logic☆10Updated 8 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- ☆23Updated 10 years ago
- ☆45Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- An approach to higher algebra in type theory☆23Updated 5 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Sort any Traversable container☆41Updated 3 years ago
- Reimplementation of Parsley in Haskell, with improvements☆56Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Library of categories, with categorical constructions on them☆56Updated last year
- Formalization of Mathematics using Type Theory of Agda Programming Language☆11Updated 7 years ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated 10 months ago
- Univalence from scratch in Idris☆19Updated 7 years ago
- rewrite rules for type-level equalities☆62Updated last year
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A really small example of the Backpack module system for Haskell☆54Updated 6 months ago
- Purely functional data structures in Idris☆10Updated 7 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- Monad Transformers and Classes☆76Updated 6 years ago
- Where my everyday research happens☆53Updated 2 weeks ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Paper and talk☆54Updated last year
- a little category theory in Idris☆10Updated 9 years ago