caotic123 / PomPom-LanguageLinks
The cuteness implementation of a dependently typed language.
☆193Updated 3 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☆171Updated last year
- Dependent type checker using normalisation by evaluation☆273Updated last year
- A fast functional language based on two level type theory☆392Updated 3 years ago
- The adventures of a Haskell compiler☆237Updated 3 months ago
- A categorical programming language with effects☆293Updated 2 years ago
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆180Updated 4 years ago
- The Makam Metalanguage☆199Updated 2 years ago
- Staged compilation with dependent types☆187Updated last week
- Spartan type theory☆273Updated 5 months ago
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆124Updated 2 weeks ago
- A small compiler for PCF☆127Updated 5 years ago
- A compiler for functional programs on serialized data☆174Updated last week
- 1ML prototype interpreter☆291Updated 5 years ago
- an implementation of stuck macros☆152Updated last month
- Frank compiler☆304Updated last year
- A small and expressive dependently typed language☆130Updated 5 years ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆133Updated 5 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆84Updated 8 years ago
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆228Updated 2 years ago
- Build system☆134Updated 3 months ago
- Embeddable Lambda Prolog Interpreter☆338Updated 2 weeks ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆120Updated 4 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 4 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆388Updated 2 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆134Updated 5 years ago
- Demo for high-performance type theory elaboration☆579Updated last week
- Day 9 of Advent of Haskell - Denotational Design☆98Updated 4 years ago
- A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell☆215Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆65Updated last year
- 😎TT☆241Updated 2 months ago