takanuva / cpsLinks
A formalization of continuation-passing style calculi in Coq [WIP]
☆36Updated last week
Alternatives and similar repositories for cps
Users that are interested in cps are comparing it to the libraries listed below
Sorting:
- Toy programming language☆19Updated last year
- Calculus of Constructions☆17Updated 5 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 4 years ago
- Package manager for Idris☆36Updated 2 years ago
- 🦠 Reusable components based on algebraic effects☆50Updated 8 months ago
- Modal Logic Library in Coq☆15Updated 3 years ago
- Untitled PL Card Game☆20Updated 4 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆27Updated last month
- Class instances for Coq inductive types with little boilerplate☆24Updated 2 months ago
- A work-in-progress core language for Agda, in Agda☆52Updated 2 weeks ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A tutorial on how Agda infers things☆43Updated 4 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 4 months ago
- Haskell implementation of nominal datatypes and functions☆43Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A very small implementation of the Calculus of Constructions for experimentation purposes☆15Updated 7 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A simple functional programming language.☆21Updated 4 years ago
- high-performance cubical evaluation☆73Updated last month
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Dromedary is an experimental subset of OCaml, using constraint-based type inference!☆48Updated 8 months ago