caotic123 / PomPom-LanguageLinks
The cuteness implementation of a dependently typed language.
☆191Updated 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 graphical interactive proof assistant designed for education☆167Updated 8 months ago
- A fast functional language based on two level type theory☆391Updated 2 years ago
- Dependent type checker using normalisation by evaluation☆263Updated 10 months ago
- The adventures of a Haskell compiler☆229Updated 2 months ago
- A categorical programming language with effects☆282Updated 2 years ago
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆177Updated 4 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- A compiler for functional programs on serialized data☆165Updated last month
- Spartan type theory☆270Updated last year
- Staged compilation with dependent types☆177Updated 2 months ago
- 1ML prototype interpreter☆285Updated 5 years ago
- Inpla: Interaction nets as a programming language (the current version)☆309Updated 9 months ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆117Updated 4 years ago
- an implementation of stuck macros☆144Updated last month
- Embeddable Lambda Prolog Interpreter☆322Updated this week
- Bologna Optimal Higher-Order Machine, Version 1.1☆74Updated 8 years ago
- 😎TT☆230Updated last year
- A sudoku game where you have to prove that your deductions are valid☆115Updated 2 years ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆129Updated last year
- A small compiler for PCF☆125Updated 4 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆381Updated last year
- My personal repository of formally verified mathematics.☆303Updated this week
- Demo for high-performance type theory elaboration☆560Updated last year
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆222Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- ☆234Updated last week
- Relational programming in Haskell. Mostly developed on twitch.☆263Updated 10 months ago
- A typed, polyglot, functional language☆202Updated this week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago