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 fast functional language based on two level type theory☆391Updated 2 years ago
- The adventures of a Haskell compiler☆232Updated 2 weeks ago
- Dependent type checker using normalisation by evaluation☆269Updated last year
- A categorical programming language with effects☆288Updated 2 years ago
- A graphical interactive proof assistant designed for education☆169Updated 11 months ago
- Spartan type theory☆271Updated last month
- The Makam Metalanguage☆200Updated 2 years ago
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆180Updated 4 years ago
- A compiler for functional programs on serialized data☆172Updated this week
- Bologna Optimal Higher-Order Machine, Version 1.1☆81Updated 8 years ago
- Staged compilation with dependent types☆183Updated 6 months ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆120Updated 4 years ago
- an implementation of stuck macros☆148Updated last week
- Inpla: Interaction nets as a programming language (the current version)☆314Updated last year
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆384Updated 2 years ago
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆116Updated last week
- 1ML prototype interpreter☆288Updated 5 years ago
- A small and expressive dependently typed language☆131Updated 5 years ago
- Demo for high-performance type theory elaboration☆570Updated 2 years ago
- A typed, polyglot, functional language☆205Updated last week
- Resources for type theory, functional programming, etc.☆320Updated 4 years ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆129Updated 2 months ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- 😎TT☆233Updated 3 months ago
- An implementation of Pie in Haskell☆211Updated 6 years ago
- ☆137Updated 3 years ago
- Frank compiler☆302Updated last year
- A minimal proof language.☆210Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year