kevinsullivan / cs1113f16
CS1 through Type Theory
☆15Updated 8 years ago
Alternatives and similar repositories for cs1113f16:
Users that are interested in cs1113f16 are comparing it to the libraries listed below
- Work in progress☆34Updated 2 months ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Category theory and algebra☆28Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Agda-style equational reasoning in Haskell☆52Updated last month
- IO using sized types and copatterns☆33Updated 3 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Directed type theory for formal category theory☆17Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- NbE course @ Chalmers☆28Updated 4 months ago
- ☆19Updated 6 months ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- ☆16Updated 7 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 5 years ago
- ☆27Updated 4 years ago
- Agda formalisation of NbE for λ□☆17Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- being the beginnings of at least zero typecheckers☆32Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago