benjaminselfridge / logix
Logic Explorer - customizable proof construction tool for sequent calculi
☆20Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for logix
- Dependently typed elimination functions using singletons☆28Updated 3 weeks ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- Linear map categories in Agda☆5Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.☆11Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- ☆17Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- Category theory and algebra☆27Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆11Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 5 years ago
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- ☆16Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 4 years ago