takanuva / cps
A formalization of continuation-passing style calculi in Coq [WIP]
☆37Updated this week
Alternatives and similar repositories for cps:
Users that are interested in cps are comparing it to the libraries listed below
- Toy programming language☆19Updated 9 months ago
- Calculus of Constructions☆17Updated 5 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last week
- A very small implementation of the Calculus of Constructions for experimentation purposes☆14Updated 6 years ago
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- Fωμ type checker and compiler☆52Updated 2 years ago
- Simplified Observational Type Theory☆81Updated last year
- Modal Logic Library in Coq☆15Updated 2 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆26Updated 4 months ago
- Package manager for Idris☆35Updated 2 years ago
- A simple functional programming language.☆21Updated 3 years ago
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆28Updated 4 years ago
- A dependently typed programming language with direct style effects and linearity☆19Updated 6 months ago
- A declarative toy language inspired on set comprehensions.☆18Updated 5 years ago
- Untitled PL Card Game☆20Updated 3 years ago
- Fast equality saturation in Haskell☆80Updated 9 months ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- 🦠 Reusable components based on algebraic effects☆48Updated 4 months ago
- ☆10Updated 3 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- ☆47Updated 2 months ago
- "Modern compiler implementation" in Haskell!☆26Updated 10 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- A core language and API for dependently typed languages☆89Updated this week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- ☆23Updated 5 months ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 8 months ago
- Class instances for Coq inductive types with little boilerplate☆24Updated 2 months ago