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 10 months ago
Alternatives and similar repositories for nlambda
Users that are interested in nlambda are comparing it to the libraries listed below
Sorting:
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- ☆45Updated 6 years ago
- Type Your Matrices For Great Good☆29Updated 5 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Library of categories, with categorical constructions on them☆57Updated 2 years ago
- Sort any Traversable container☆41Updated 3 years ago
- "Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct)☆40Updated 10 years ago
- An experimental Haskell library for programming with effectful runners.☆30Updated 5 years ago
- http://www.cse.chalmers.se/edu/course/afp/☆16Updated 9 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- ☆23Updated 10 years ago
- Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)☆161Updated 4 years ago
- ☆21Updated 3 years ago
- Cofun with Cofree Comonads☆32Updated 9 years ago
- An approach to higher algebra in type theory☆23Updated 5 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- Paper and talk☆55Updated 2 years ago
- First-class type families☆88Updated last month
- constraint level if statements☆117Updated 7 years ago
- Learn the Agda basics in three 2-hour sessions.☆60Updated last year
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Tutorial for LiquidHaskell☆79Updated 11 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated last month
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Reimplementation of Parsley in Haskell, with improvements☆58Updated last year
- A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comon…☆156Updated 4 years ago
- A Haskell library for open records and variants using closed type families and type literals☆112Updated 3 years ago