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
- A tutorial on how Agda infers things☆58Updated last week
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 5 months ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- Calculus of Constructions☆17Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 9 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- https://metaborg.github.io/mj.agda/☆13Updated 4 years ago
- Untitled PL Card Game☆20Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Haskell implementation of nominal datatypes and functions☆43Updated 4 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.☆114Updated 8 years ago
- Benchmarks for capture-avoiding substitution☆119Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 10 months ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- 🧊 Модальний гомотопічний верифікатор математики☆22Updated last month
- A declarative toy language inspired on set comprehensions.☆18Updated 6 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago