heades / System-F-CoqLinks
System F in coq.
☆19Updated 10 years ago
Alternatives and similar repositories for System-F-Coq
Users that are interested in System-F-Coq are comparing it to the libraries listed below
Sorting:
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Category theory and algebra☆28Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A collection of mechanised proofs☆17Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- The Prettiest Printer☆35Updated last year
- System F implemented in Haskell☆24Updated 13 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago