yveszhang / ldtyping
☆12Updated 8 years ago
Alternatives and similar repositories for ldtyping:
Users that are interested in ldtyping are comparing it to the libraries listed below
- Formalizing nbe in agda☆30Updated 12 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- ☆16Updated 3 years ago
- Category theory and algebra☆28Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- Mtac in Agda☆28Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 weeks ago
- Where my everyday research happens☆52Updated 3 weeks ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 6 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago