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 4 months ago
Alternatives and similar repositories for nlambda:
Users that are interested in nlambda are comparing it to the libraries listed below
- An approach to higher algebra in type theory☆23Updated 4 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- Sort any Traversable container☆41Updated 2 years ago
- Type Your Matrices For Great Good☆30Updated 4 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 7 years ago
- A simple GUI for Agda☆31Updated 9 years ago
- Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.☆42Updated 3 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Constrained versions of the Haskell standard category-theory-based type classes, using ConstraintKinds☆22Updated last year
- Library of categories, with categorical constructions on them☆54Updated last year
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- ☆45Updated 5 years ago
- An embedded probabilistic programming language.☆34Updated 7 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- Generic random generators☆81Updated last year
- "Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct)☆40Updated 9 years ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- Formalization of Linear Logic☆10Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 6 months ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Haskell library for doing category theory with a central role for profunctors☆19Updated last week
- Purely-functional, coordinate-free linear algebra☆28Updated 6 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last year