Alternatives and similar repositories for pcc116-2021-2

Users that are interested in pcc116-2021-2 are comparing it to the libraries listed below

• takanuva / cps
  A formalization of continuation-passing style calculi in Coq [WIP]
  ☆37Updated this week
• samueldurantes / haildo
  Toy programming language
  ☆20Updated last year
• algebraic-dev / idris-4-noobs
  📘 | Idris2 for Portuguese speakers. (Its called idris2noobs as a reference to the version 2 of the language).
  ☆48Updated 3 years ago
• VictorTaelin / calculus-of-constructions
  Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.
  ☆116Updated 8 years ago
• celsobonutti / milho
  The Haskell implementation of the Milho programming language.
  ☆29Updated 2 years ago
• arielsilveira / ModalLibrary
  Modal Logic Library in Coq
  ☆16Updated 3 years ago
• moonad-archive / Formality-JavaScript
  An implementation of the Formality language in JavaScript
  ☆71Updated 6 years ago
• VictorTaelin / formality-agda-lib-legacy
  Agda libraries relevant to Moonad
  ☆14Updated 6 years ago
• takanuva / coc
  Calculus of Constructions
  ☆17Updated 6 years ago
• HigherOrderCO / Kindex
  Collection of Kind2 programs and proofs
  ☆12Updated last year
• luizperes / cantor
  A declarative toy language inspired on set comprehensions.
  ☆18Updated 6 years ago
• VictorTaelin / Cedille-Core
  A minimal proof language.
  ☆211Updated 6 years ago
• EduardoRFS / youtube-channel
  ☆52Updated 4 months ago
• VictorTaelin / taemoba
  ☆14Updated last year
• algebraic-dev / nuko
  🎮 | Is a programming language aimed at incorporating everything I’d like to have in Haskell, except dependent types.
  ☆15Updated 3 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆86Updated 2 years ago
• unnohideyuki / Tiger-in-Haskell
  "Modern compiler implementation" in Haskell!
  ☆28Updated 10 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 5 months ago
• folivetti / Category4Programmers
  annotations and solutions for the book Category Theory for Programmers by Bartosz Milewski
  ☆20Updated 6 years ago
• ncihnegn / miranda
  Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…
  ☆64Updated 7 months ago
• gelisam / klister
  an implementation of stuck macros
  ☆149Updated 2 weeks ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆121Updated 7 months ago
• matteo-meluzzi / agda2hvm
  ☆12Updated 2 years ago
• VictorTaelin / absal-ex
  Absal ex
  ☆58Updated 2 years ago
• VictorTaelin / ultimate-calculus
  ☆36Updated 4 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 5 years ago
• ryukinix / discrete-mathematics
  A computational way to study discrete mathematics using Haskell
  ☆73Updated 6 years ago
• aripiprazole / lura
  🍞 | IDE focused programming language study
  ☆37Updated last year
• VictorTaelin / articles
  Thoughts and stuff
  ☆70Updated 5 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆110Updated 10 years ago