steshaw / lennart-lambdaLinks
λλλλ Lennart Augustsson's λ-calculus cooked four ways
☆53Updated 8 years ago
Alternatives and similar repositories for lennart-lambda
Users that are interested in lennart-lambda are comparing it to the libraries listed below
Sorting:
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 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☆53Updated last week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- Fine-grained lattice primitives for Haskell☆37Updated last month
- The Software Foundations book, in GHC☆82Updated 5 months ago
- Generic functions for single-sorted first-order structural unification☆46Updated last month
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated 10 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated last week
- ☆40Updated 5 years ago
- rewrite rules for type-level equalities☆62Updated last year
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Learn the Agda basics in three 2-hour sessions.☆59Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago