JasonGross / lobLinks
Two attempts at formalizing Löb's Theorem, (one based on http://lesswrong.com/lw/t6/the_cartoon_guide_to_l%C3%B6bs_theorem/). Write-up at https://github.com/JasonGross/lob-paper
☆25Updated 2 years ago
Alternatives and similar repositories for lob
Users that are interested in lob are comparing it to the libraries listed below
Sorting:
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Web based opetopic editor☆36Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- ☆21Updated 7 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- ☆84Updated 8 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A (formalised) general definition of type theories☆58Updated 4 years ago
- An enhanced unification algorithm for Coq☆58Updated 3 weeks ago
- A formalization of M-types in Agda☆36Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Constructive Galois connections☆36Updated 7 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 11 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- ☆17Updated 7 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Base library for HoTT in Agda☆38Updated 6 years ago
- ☆48Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago