barry-jay-personal / typed_tree_calculus
types for various combinatory systems, especialy tree calculi
☆17Updated 3 months ago
Alternatives and similar repositories for typed_tree_calculus
Users that are interested in typed_tree_calculus are comparing it to the libraries listed below
Sorting:
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- A formal consistency proof of Quine's set theory New Foundations☆70Updated last week
- A toy example of a verified compiler.☆28Updated 3 weeks ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆49Updated 7 months ago
- A verified compiler for a lazy functional language☆36Updated this week
- Bologna Optimal Higher-Order Machine, Version 1.1☆72Updated 8 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆27Updated 2 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆63Updated 7 months ago
- Formalising the WASM spec in Lean☆23Updated 10 months ago
- Demo for dependent types + runtime code generation☆69Updated 3 months ago
- A work-in-progress core language for Agda, in Agda☆52Updated last month
- A Lean 4 library for configuring Command Line Interfaces and parsing command line arguments.☆75Updated 2 weeks ago
- An experimental category theory library for Lean☆51Updated last year
- LaTeX code for a paper on lean's type theory☆132Updated 2 years ago
- ☆43Updated 3 years ago
- ☆35Updated last year
- Datatypes as quotients of polynomial functors☆35Updated 5 years ago
- HoTT in Lean 3☆80Updated 4 years ago
- Paper and talk☆54Updated last year
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Lean 4 kernel / 'external checker' written in Lean 4☆102Updated 3 months ago
- Hoare Type Theory☆75Updated last week
- Agda lecture notes for the Functional Programming course at TU Delft☆125Updated last year
- High level commands to declare a hierarchy based on packed classes☆99Updated this week
- Slides and handwritten notes on the course on models of programming languages☆51Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆66Updated 2 weeks ago
- ☆34Updated 6 months ago