Alternatives and similar repositories for cps

Users that are interested in cps are comparing it to the libraries listed below

• samueldurantes / haildo
  Toy programming language
  ☆20Updated last year
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 6 months ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆110Updated 10 years ago
• takanuva / coc
  Calculus of Constructions
  ☆17Updated 6 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• bobatkey / sott
  Simplified Observational Type Theory
  ☆87Updated 2 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• wenkokke / setup-agda
  Set up a specific version of Agda for your GitHub Actions workflow.
  ☆28Updated 2 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆45Updated 11 months ago
• cedille / ial
  The Iowa Agda Library
  ☆53Updated 2 months ago
• bollu / minitt
  bollu learns implementation of dependent typing
  ☆34Updated 2 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 10 months ago
• pi8027 / lambda-calculus
  A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
  ☆86Updated 5 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆121Updated 7 months ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆86Updated 4 years ago
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆51Updated 2 months ago
• tomdjong / MGS-domain-theory
  Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…
  ☆48Updated last month
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆63Updated this week
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated last month
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆56Updated 2 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆68Updated last year
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆86Updated 4 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆71Updated 2 months ago
• frex-project / idris-frex
  ☆51Updated 5 months ago