tdietert / lambda-piLinks
A toy implementation of the dependently typed lambda calculus known as λΠ
☆12Updated 6 years ago
Alternatives and similar repositories for lambda-pi
Users that are interested in lambda-pi are comparing it to the libraries listed below
Sorting:
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆84Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- A Really Cool Calculator written in Haskell... or is it?☆44Updated 4 years ago
- Bidirectional Parsing. Work in Progress☆33Updated last year
- experimenting with unlifted classes via backpack☆37Updated 3 years ago
- A library for doing generic programming in Agda☆36Updated 5 years ago
- Haskell embedding of PlusCal☆62Updated 3 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆61Updated this week
- Profunctor optics for the endofunctor category on Hask☆27Updated 5 years ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 6 months ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- ☆52Updated 5 months ago
- An interpreted lambda calculus with Algebraic and Recursive Types.☆20Updated 4 years ago
- Haskell library for semigroup actions and torsors☆64Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 6 years ago
- Staged push/pull fusion with typed Template Haskell☆62Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated last year
- Strongly-typed System F in Haskell☆120Updated 3 years ago
- Reimplementation of Parsley in Haskell, with improvements☆60Updated 3 months ago
- Type Your Matrices For Great Good☆29Updated 5 years ago
- Haskell library for doing category theory with a central role for profunctors☆24Updated this week
- A tutorial on how Agda infers things☆63Updated 6 months ago
- An experimental Haskell library for programming with effectful runners.☆30Updated 6 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆63Updated 6 months ago
- There are many category theory implementations, but this one is mine☆16Updated last year
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated last month