ecaustin / haskhol-coreLinks
The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.
☆2Updated 8 years ago
Alternatives and similar repositories for haskhol-core
Users that are interested in haskhol-core are comparing it to the libraries listed below
Sorting:
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- ☆26Updated 8 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last week
- A simple implementation of linear type theory☆38Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ☆12Updated 5 years ago
- Examples from Introduction to Programming in ATS☆26Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Type theory in type theory☆16Updated 13 years ago
- ☆23Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- ☆18Updated 3 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Diploma work (if this is still here contact me if you need details)☆13Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆13Updated 7 years ago