VictorTaelin / Interaction-Type-Theory
☆117Updated last year
Alternatives and similar repositories for Interaction-Type-Theory:
Users that are interested in Interaction-Type-Theory are comparing it to the libraries listed below
- A minimal proof checker.☆72Updated 5 months ago
- Collection of Kind2 programs and proofs☆11Updated 8 months ago
- Inpla: Interaction nets as a programming language (the current version)☆285Updated 3 months ago
- A Language with Dependent Data and Codata Types☆80Updated this week
- A proof assistant for higher-dimensional type theory☆162Updated last week
- Pure functional programming with whole-program mutability inference☆64Updated 3 weeks ago
- ☆44Updated last month
- Staged compilation with dependent types☆168Updated this week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 9 months ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 3 years ago
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆221Updated last year
- Demo for dependent types + runtime code generation☆66Updated 2 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆69Updated 7 years ago
- ☆38Updated 3 years ago
- A garden of small programming language implementations 🪴☆201Updated this week
- Dependent type checker using normalisation by evaluation☆256Updated 5 months ago
- Parser Combinator Library for Lean 4☆45Updated last week
- Trying to write an understandable implementation of Haskell, in Haskell☆120Updated 4 years ago
- A minimal pure functional language based on self dependent types.☆72Updated 2 years ago
- A categorical programming language with effects☆273Updated last year
- Benchmarks for capture-avoiding substitution☆109Updated this week
- A zero-knowledge Lean4 compiler and kernel☆127Updated 3 months ago
- The Makam Metalanguage☆197Updated last year
- A simple ML-like programming language with subtyping and full type inference.☆168Updated 2 months ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆125Updated 10 months ago
- an experimental new programming language based on interaction nets☆29Updated this week
- 🌐 | HTTP primitives for Lean 4☆31Updated 3 months ago
- LaTeX code for a paper on lean's type theory☆129Updated 2 years ago
- Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf☆29Updated 9 months ago
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆161Updated 3 years ago