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 5 months ago
Alternatives and similar repositories for nlambda:
Users that are interested in nlambda are comparing it to the libraries listed below
- Type Your Matrices For Great Good☆30Updated 4 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- ☆45Updated 5 years ago
- A suite of Haskell libraries for representing, manipulating, and sampling random variables☆42Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Library of categories, with categorical constructions on them☆56Updated last year
- Categorical logic from a categorical point of view☆78Updated last year
- A simple GUI for Agda☆31Updated 9 years ago
- Purely functional data structures in Idris☆10Updated 7 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- A place to collect work on dialectica categories.☆26Updated 2 months ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 8 years ago
- Cofun with Cofree Comonads☆31Updated 8 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- An approach to higher algebra in type theory☆23Updated 4 years ago
- Where my everyday research happens☆52Updated 3 weeks ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 6 years ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- Agda programming with holes☆27Updated 4 years ago
- Generic random generators☆81Updated 2 years ago
- Some tools for provability logic☆37Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated 3 weeks ago
- http://www.cse.chalmers.se/edu/course/afp/☆16Updated 9 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago