takanuva / cpsLinks
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
Sorting:
- Toy programming language☆20Updated last year
- A tutorial on how Agda infers things☆63Updated 4 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Simplified Observational Type Theory☆86Updated 2 years ago
- Calculus of Constructions☆17Updated 6 years ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆28Updated last month
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Haskell implementation of nominal datatypes and functions☆44Updated 5 years ago
- bollu learns implementation of dependent typing☆34Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆85Updated 5 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- The Iowa Agda Library☆50Updated last week
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 months ago
- 🦠 Reusable components based on algebraic effects☆51Updated this week
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- A work-in-progress core language for Agda, in Agda☆59Updated 2 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 5 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆47Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- A simple functional programming language.☆22Updated 4 years ago
- ☆51Updated 3 months ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Library of the ##dependent distributed research support group☆117Updated last year
- high-performance cubical evaluation☆76Updated 6 months ago