robrix / sequoiaLinks
classical sequent calculus, embedded in Haskell
☆20Updated 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
- Haskell library for doing category theory with a central role for profunctors☆21Updated last week
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Session Types with Priority in Linear Haskell☆26Updated 11 months ago
- Generic functions for single-sorted first-order structural unification☆46Updated last month
- Category theory formalized in cubical agda☆20Updated 5 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- ☆12Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- ☆18Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- GHC plugin to branch on whether a constraint is satisfied☆33Updated 2 months ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- Lambda normalization and conversion checking benchmarks for various implementations☆58Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 3 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago