halfaya / BayHac
☆11Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for BayHac
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- A Racket library for interacting with Idris over the IDE protocol☆30Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- Miller/pattern unification in Agda☆62Updated 10 years ago
- The Prettiest Printer☆35Updated 9 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated 11 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- System F in coq.☆19Updated 9 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 8 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- Type theory in type theory☆16Updated 12 years ago
- ☆11Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- ☆22Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago