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:
- Base library for HoTT in Agda☆38Updated 6 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- An enhanced unification algorithm for Coq☆58Updated last month
- ☆85Updated 8 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- Constructive Galois connections☆36Updated 7 years ago
- ☆48Updated 6 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆24Updated last month
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- second-order abstract syntax☆31Updated 4 years ago
- Web based opetopic editor☆36Updated last year
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Multimode simple type theory as an Agda library.☆23Updated last year