JasonGross / lob
Two attempts at formalizing Löb's Theorem, (one based on http://lesswrong.com/lw/t6/the_cartoon_guide_to_l%C3%B6bs_theorem/)
☆22Updated last year
Related projects ⓘ
Alternatives and complementary repositories for lob
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- being an experiment with potato power☆23Updated 4 years ago
- Type theory in type theory☆16Updated 12 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 9 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆17Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Revised Omega-categorical Typechecker☆25Updated 2 weeks ago
- ☆20Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- ☆18Updated 2 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆22Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated 2 months ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Base library for HoTT in Agda☆36Updated 5 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last year
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 7 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago