steshaw / lennart-lambda
λλλλ Lennart Augustsson's λ-calculus cooked four ways
☆52Updated 7 years ago
Alternatives and similar repositories for lennart-lambda:
Users that are interested in lennart-lambda are comparing it to the libraries listed below
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Where my everyday research happens☆52Updated this week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- being the materials for Summer 2013's course☆112Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- ☆40Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- The Software Foundations book, in GHC☆82Updated 2 months ago
- do-notation for Category and "Arrow without arr"☆63Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆42Updated last week
- Tiny type-checker with dependent types☆76Updated 11 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Library of categories, with categorical constructions on them☆56Updated last year
- Haskell library for semigroup actions and torsors☆60Updated last month
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- Recursion schemes for Idris☆64Updated 6 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Fine-grained lattice primitives for Haskell☆36Updated last month
- Literature review of GHC's Core language, System FC☆66Updated 6 years ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆80Updated 5 years ago