barry-jay-personal / typed_tree_calculusLinks
types for various combinatory systems, especialy tree calculi
☆23Updated 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☆40Updated 2 months ago
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆119Updated last month
- A custom parser/auto-formatter for Standard ML☆86Updated 4 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆62Updated last year
- A verified compiler for a lazy functional language☆37Updated this week
- Demo for dependent types + runtime code generation☆72Updated 10 months ago
- A toy dependent typed language.☆35Updated last week
- Specification of the Cedille Core language☆34Updated 5 years ago
- The Twelf Programming Language☆147Updated 2 weeks ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- Bologna Optimal Higher-Order Machine, Version 1.1☆83Updated 8 years ago
- ☆46Updated 3 months ago
- A sudoku game where you have to prove that your deductions are valid☆117Updated 3 years ago
- Reference compiler for c0☆38Updated 2 weeks ago
- a self-hosting lambda calculus compiler☆37Updated 8 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆66Updated last month
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- Ideas, documents, and tutorial pile for the Prowl Language☆12Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 weeks ago
- ☆37Updated last year
- The Candle theorem prover (fork of the HOL Light sources)☆16Updated last year
- Accompanying materials for "A Core Calculus for Documents"☆35Updated 2 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆62Updated 7 months ago
- Fir programming language☆89Updated this week
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 2 months ago
- SKI combinators☆56Updated 8 years ago
- Type-checker for the λΠ-calculus modulo rewriting☆224Updated last month