takanuva / cps
A formalization of continuation-passing style calculi in Coq [WIP]
☆37Updated 3 weeks ago
Alternatives and similar repositories for cps:
Users that are interested in cps are comparing it to the libraries listed below
- Toy programming language☆19Updated 10 months ago
- Calculus of Constructions☆17Updated 5 years ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last week
- Set up a specific version of Agda for your GitHub Actions workflow.☆27Updated 5 months ago
- Simplified Observational Type Theory☆81Updated last year
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last month
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Dromedary is an experimental subset of OCaml, using constraint-based type inference!☆48Updated 5 months ago
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Updated last year
- being a particular fragment of Haskell, extended to a proof system☆30Updated 3 weeks ago
- Agda libraries relevant to Moonad☆14Updated 5 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 3 months ago
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 4 years ago
- A declarative toy language inspired on set comprehensions.☆18Updated 6 years ago
- Class instances for Coq inductive types with little boilerplate☆24Updated last month
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year
- ☆40Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- Haskell implementation of nominal datatypes and functions☆39Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆56Updated 6 months ago
- ☆24Updated 6 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated 2 weeks ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- ☆36Updated 3 years ago
- Demo for dependent types + runtime code generation☆67Updated last month
- Fast equality saturation in Haskell☆84Updated last month
- high-performance cubical evaluation☆70Updated 3 months ago