Alternatives and similar repositories for alternatives-reading-list:

Users that are interested in alternatives-reading-list are comparing it to the libraries listed below

• fplab / ui-for-pl
  User Interfaces for Programming Languages: The Compendium
  ☆27Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆37Updated 6 years ago
• joelburget / lvca
  language verification, construction, and analysis
  ☆20Updated 2 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated 7 months ago
• statebox / fsm-oracle
  Finite state machines as graphs
  ☆59Updated 4 years ago
• levjj / esverify-theory
  Formalism and proofs for esverify
  ☆20Updated 6 years ago
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated 6 years ago
• coeffects / coeffects-thesis
  The theory of coeffects presented in the dead wood format. Crocodile leather bound copies available upon request.
  ☆26Updated 7 years ago
• chrisroman / coc
  Calculus of Constructions Implementation
  ☆15Updated 5 years ago
• cdfa / frugel
  An error-tolerant live programming environment (my Master's thesis)
  ☆18Updated 2 years ago
• google / idris-protobuf
  A partial implementation of Protocol Buffers in Idris
  ☆30Updated 7 years ago
• Barry-Jay / Intensional-computation
  translations of a lambda abstraction to combinations of operators
  ☆18Updated 5 years ago
• CategoricalData / catdb
  Category theory in Coq, by Jason Gross
  ☆14Updated 9 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 6 years ago
• madgen / temporalog
  A Datalog extension to reason about time with CTL operators
  ☆14Updated 5 years ago
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 10 years ago
• chessai / hsdatalog
  BDD-based implementation of Datalog
  ☆37Updated 4 years ago
• robrix / tilec
  Sometimes when I feel sad I implement a dependently typed lambda calculus.
  ☆15Updated 4 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• mcneissue / purescript-snap
  An approach to user interfaces based in denotational design.
  ☆26Updated 2 years ago
• cedille / cedille-cast
  Source files used for the Cedille Cast videos
  ☆12Updated 4 years ago
• tmountain / purescript-reproducible
  A short guide detailing how to bootstrap PureScript.
  ☆26Updated 5 years ago
• dannywillems / RML
  ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.
  ☆36Updated 2 years ago
• jdan / compiler.lean
  A formally verified compiler for a simple language with numbers and sums
  ☆26Updated 4 years ago
• CategoricalData / HoTT-categories
  A category theory library built on top of Homotopy Type Theory, by Jason Gross
  ☆25Updated 11 years ago