clayrat / sequent-calcLinks
Experiments with sequent calculi
☆27Updated 4 years ago
Alternatives and similar repositories for sequent-calc
Users that are interested in sequent-calc are comparing it to the libraries listed below
Sorting:
- The Evolution of a Typechecker☆54Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Where my everyday research happens☆53Updated last month
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆52Updated last week
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆12Updated 10 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- ☆48Updated last month
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 months ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago