barry-jay-personal / typed_tree_calculusLinks
types for various combinatory systems, especialy tree calculi
☆18Updated 5 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 Lévy-optimal lambda calculus reducer with a backdoor to C☆23Updated last week
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- A custom parser/auto-formatter for Standard ML☆78Updated 2 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated 3 weeks ago
- A toy example of a verified compiler.☆28Updated 2 months ago
- Hanoi tower in Coq☆26Updated last week
- Reference compiler for c0☆36Updated last month
- Book about using Lean with How To Prove It☆19Updated 3 weeks ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated last month
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- A toy dependent typed language.☆30Updated this week
- A Seamless, Interactive Tactic Learner and Prover for Coq☆72Updated last week
- A deterministic parser with fused lexing☆73Updated 2 years ago
- Lean type-checker written in Scala.☆36Updated 3 years ago
- Effective Algebraic Topology in Haskell☆91Updated 10 months ago
- Experimental tree-sitter parser for the Lean (4) Theorem Prover☆34Updated 6 months ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- ☆17Updated last year
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆53Updated 5 months ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- ☆34Updated 8 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆58Updated last month
- A book about functional programming in Lean☆42Updated last year
- ☆43Updated 3 years ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago