yveszhang / ldtypingLinks
☆12Updated 9 years ago
Alternatives and similar repositories for ldtyping
Users that are interested in ldtyping are comparing it to the libraries listed below
Sorting:
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Category theory and algebra☆26Updated 9 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- ☆16Updated 3 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated 2 weeks ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 weeks ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Where my everyday research happens☆55Updated 2 weeks ago