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 7 months ago
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 2 years ago
- Type Your Matrices For Great Good☆29Updated 4 years ago
- Library of categories, with categorical constructions on them☆57Updated last year
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- ☆45Updated 5 years ago
- Constrained versions of the Haskell standard category-theory-based type classes, using ConstraintKinds☆22Updated 2 years ago
- A tutorial on writing Haskell Language Server plugins☆70Updated 4 years ago
- Categorical logic from a categorical point of view☆78Updated last year
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- A suite of Haskell libraries for representing, manipulating, and sampling random variables☆43Updated last year
- 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
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- An approach to higher algebra in type theory☆23Updated 5 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- constraint level if statements☆116Updated 7 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆54Updated 2 years ago
- Paper and talk☆54Updated last year
- ☆23Updated 9 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- Generic random generators☆81Updated 2 years ago
- Wailing into the primordial ooze of category theory☆55Updated 3 weeks ago
- Purely functional data structures in Idris☆10Updated 7 years ago
- Learn the Agda basics in three 2-hour sessions.☆57Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- Haskell library for semigroup actions and torsors☆62Updated 4 months 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