Nimita311 / incredible-solutionLinks
Solutions to the Incredible Proof Machine http://incredible.pm/
☆9Updated 5 years ago
Alternatives and similar repositories for incredible-solution
Users that are interested in incredible-solution are comparing it to the libraries listed below
Sorting:
- bollu learns implementation of dependent typing☆30Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆119Updated last month
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆61Updated this week
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- Lecture notes on realizability☆74Updated 4 months ago
- a proof-of-concept programming language based on call-by-push-value☆54Updated last week
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- A tutorial on how Agda infers things☆58Updated last week
- ☆25Updated 10 months ago
- Markdown file of the list and explanations of all mathlib4 tactics☆44Updated last year
- Categorical Logic Notes☆79Updated 3 years ago
- LaTeX code for a paper on lean's type theory☆139Updated 2 years ago
- maze game encoded in Lean 4 syntax☆59Updated 2 weeks ago
- Distributors - Unifying Parsers, Printers & Grammars☆25Updated this week
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- antifunext☆34Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆21Updated this week
- SDL2 bindings for lean☆22Updated last year
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated 3 weeks ago
- A type theory for tiny objects☆17Updated last year
- ♾️ A library for universe levels and universe polymorphism☆34Updated 7 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆22Updated 3 months ago
- Setoid type theory implementation☆38Updated last year
- ☆21Updated 4 years ago