barry-jay-personal / typed_tree_calculusLinks
types for various combinatory systems, especialy tree calculi
☆23Updated 10 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☆37Updated last month
- A custom parser/auto-formatter for Standard ML☆84Updated 3 months ago
- The Twelf Programming Language☆143Updated 2 weeks ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆65Updated 2 weeks ago
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆115Updated 2 weeks ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆83Updated 8 years ago
- Fir programming language☆81Updated last week
- Reference compiler for c0☆38Updated 2 weeks ago
- Demo for dependent types + runtime code generation☆72Updated 9 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- The Candle theorem prover (fork of the HOL Light sources)☆16Updated last year
- A formal consistency proof of Quine's set theory New Foundations☆75Updated 5 months ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆60Updated 6 months ago
- Accompanying materials for "A Core Calculus for Documents"☆35Updated 2 years ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆118Updated last week
- Files associated with the course Interactive Theorem Proving at LMU SoSe 2024☆62Updated last year
- Type-checker for the λΠ-calculus modulo rewriting☆223Updated last week
- Specification of the Cedille Core language☆34Updated 5 years ago
- Language based on Rewriting Logic☆148Updated last week
- Admiran is a pure, lazy, functional language and self-hosting compiler based upon Miranda☆82Updated this week
- A verified compiler for a lazy functional language☆36Updated last week
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A toy example of a verified compiler.☆31Updated 7 months ago
- Programming with pure lambda calculus☆132Updated 2 weeks ago
- Lean type-checker written in Scala.☆40Updated 3 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆77Updated this week
- The Makam Metalanguage☆197Updated 2 years ago
- SKI combinators☆55Updated 8 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago