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
☆25Jun 30, 2023Updated 2 years ago
Alternatives and similar repositories for lob
Users that are interested in lob are comparing it to the libraries listed below
Sorting:
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Collaborative work on reversible computing☆18Aug 3, 2022Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Apr 3, 2023Updated 2 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Selective applicative functors laws and theorems☆15Mar 12, 2020Updated 5 years ago
- ☆18May 10, 2022Updated 3 years ago
- Collaborative work on reversible computing☆25Oct 30, 2021Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- A thicker variant of Latin Modern Roman☆15Jun 6, 2025Updated 8 months ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- My old Agda code for Homotopy Type Theory. (Halted. See HoTT/HoTT-Agda for the new one.)☆27Aug 14, 2014Updated 11 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- Summer school on programming in Agda☆68Aug 1, 2023Updated 2 years ago
- Where my everyday research happens☆56Feb 17, 2026Updated last week
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Sep 3, 2019Updated 6 years ago
- A type theory based theorem proving library☆25Aug 23, 2011Updated 14 years ago
- ☆21Sep 8, 2021Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago
- Base library for HoTT in Agda☆39Apr 2, 2019Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- Reference type checker for the Lean theorem prover☆63Mar 17, 2017Updated 8 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆25Nov 29, 2025Updated 3 months ago
- A formalization of (homotopy) limits in Homotopy Type Theory☆11Jan 11, 2015Updated 11 years ago
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- Merge sort correctness proof☆11May 21, 2015Updated 10 years ago
- A simple GUI for Agda☆31Dec 13, 2015Updated 10 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Jul 22, 2021Updated 4 years ago
- Ring solver for Idris☆20Nov 12, 2018Updated 7 years ago