barry-jay-personal / tree-calculus
Proofs in Coq for the book Reflective Programs in Tree Calculus
☆170Updated 3 years ago
Alternatives and similar repositories for tree-calculus:
Users that are interested in tree-calculus are comparing it to the libraries listed below
- An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax☆101Updated this week
- The cuteness implementation of a dependently typed language.☆190Updated 2 years ago
- Inpla: Interaction nets as a programming language (the current version)☆299Updated 5 months ago
- The MaPLe compiler: efficient and scalable parallel functional programming☆376Updated last month
- A graphical interactive proof assistant designed for education☆167Updated 5 months ago
- Staged compilation with dependent types☆171Updated this week
- Par (⅋) is an experimental concurrent programming language. It's an attempt to bring the expressive power of linear logic into practice.☆171Updated this week
- A modern supercompiler for call-by-value functional languages☆407Updated last week
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆113Updated this week
- A minimal proof checker.☆75Updated 7 months ago
- A compiler for functional programs on serialized data☆161Updated 2 weeks ago
- A fast functional language based on two level type theory☆390Updated 2 years ago
- Forge: A Tool and Language for Teaching Formal Methods☆74Updated this week
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆222Updated last year
- Metamath Zero specification language☆338Updated last week
- Embeddable Lambda Prolog Interpreter☆309Updated this week
- Hitchhiker's Guide to Logical Verification (2023 Edition)☆100Updated last year
- The Principia Rewrite☆218Updated 2 months ago
- Companion files for Logical Verification 2020–2021 at VU Amsterdam☆96Updated 4 years ago
- A categorical programming language with effects☆276Updated 2 years ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆125Updated last year
- Accelerated machine learning with dependent types☆93Updated this week
- Turnstyle is a graphical esoteric programming language based on lambda calculus☆80Updated 6 months ago
- Haskell implemented with combinators☆473Updated this week
- ☆82Updated 2 months ago
- A simple raytracer written in Lean 4☆134Updated 11 months ago
- Algorithmic Information Theory, using Binary Lambda Calculus☆157Updated 2 weeks ago
- A garden of small programming language implementations 🪴☆221Updated this week
- Files associated with the course Interactive Theorem Proving at LMU SoSe 2024☆62Updated 8 months ago
- The adventures of a Haskell compiler☆225Updated 4 months ago