robrix / sequoiaLinks
classical sequent calculus, embedded in Haskell
☆21Updated 3 years ago
Alternatives and similar repositories for sequoia
Users that are interested in sequoia are comparing it to the libraries listed below
Sorting:
- A usable type system for call by push-value☆33Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- ICFP tutorial☆39Updated 4 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Where my everyday research happens☆54Updated 2 months ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- Category theory formalized in cubical agda☆21Updated 5 years ago
- Haskell library for doing category theory with a central role for profunctors☆23Updated this week
- ☆12Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Generic functions for single-sorted first-order structural unification☆46Updated 3 months ago
- Funny little Haskell impl☆18Updated 4 years ago
- A library for doing generic programming in Agda☆32Updated 4 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A Teeny Type Theory☆26Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Staged Streams and other stuff☆18Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆16Updated 3 years ago