caotic123 / PomPom-LanguageLinks
The cuteness implementation of a dependently typed language.
☆193Updated 2 years ago
Alternatives and similar repositories for PomPom-Language
Users that are interested in PomPom-Language are comparing it to the libraries listed below
Sorting:
- A categorical programming language with effects☆283Updated 2 years ago
- A fast functional language based on two level type theory☆391Updated 2 years ago
- A graphical interactive proof assistant designed for education☆169Updated 9 months ago
- Dependent type checker using normalisation by evaluation☆265Updated 11 months ago
- The adventures of a Haskell compiler☆230Updated 3 months ago
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆178Updated 4 years ago
- Spartan type theory☆269Updated last year
- The Makam Metalanguage☆199Updated 2 years ago
- A compiler for functional programs on serialized data☆166Updated 2 months ago
- an implementation of stuck macros☆145Updated last week
- Staged compilation with dependent types☆179Updated 3 months ago
- 1ML prototype interpreter☆286Updated 5 years ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆118Updated 4 years ago
- A sudoku game where you have to prove that your deductions are valid☆116Updated 2 years ago
- Inpla: Interaction nets as a programming language (the current version)☆309Updated 9 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆75Updated 8 years ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆130Updated this week
- 😎TT☆231Updated last week
- An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax☆111Updated last month
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆382Updated last year
- Embeddable Lambda Prolog Interpreter☆325Updated this week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Demo for high-performance type theory elaboration☆564Updated last year
- A minimal proof language.☆208Updated 6 years ago
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆223Updated last year
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- ☆90Updated 3 years ago
- Resources for type theory, functional programming, etc.☆321Updated 4 years ago
- My personal repository of formally verified mathematics.☆304Updated this week
- ☆233Updated last week