barry-jay-personal / typed_tree_calculusLinks
types for various combinatory systems, especialy tree calculi
☆24Updated 11 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☆41Updated 3 months ago
- A custom parser/auto-formatter for Standard ML☆88Updated 2 weeks ago
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆122Updated 2 weeks ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆63Updated last year
- The Twelf Programming Language☆147Updated last month
- A sudoku game where you have to prove that your deductions are valid☆117Updated 3 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆83Updated 8 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆66Updated last month
- A simple raytracer written in Lean 4☆143Updated last year
- LaTeX code for a paper on lean's type theory☆157Updated 3 years ago
- Admiran is a pure, lazy, functional language and self-hosting compiler based upon Miranda☆81Updated last week
- Specification of the Cedille Core language☆34Updated 5 years ago
- A formal consistency proof of Quine's set theory New Foundations☆77Updated 6 months ago
- A toy example of a verified compiler.☆31Updated 8 months ago
- ☆46Updated 4 months ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆121Updated last week
- Reference compiler for c0☆39Updated last month
- Lean 4 kernel / 'external checker' written in Lean 4☆152Updated this week
- File format and optimizer for programs encoded in binary lambda calculus☆17Updated last year
- Demo for dependent types + runtime code generation☆72Updated 10 months ago
- Fir programming language☆90Updated this week
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- Type-checker for the λΠ-calculus modulo rewriting☆225Updated last month
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆65Updated 7 months ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- Programming with pure lambda calculus☆140Updated last month
- ☆42Updated 5 months ago
- Lean type-checker written in Scala.☆40Updated 3 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- An implementation of interaction nets as a forth-like language.☆44Updated 2 months ago