Alternatives and similar repositories for cspgen

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

• taktoa / eqsat
  A language-generic implementation of equality saturation in Haskell
  ☆21Updated 6 years ago
• mrkgnao / pico
  The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)
  ☆15Updated 7 years ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 7 years ago
• thoughtpolice / asc
  Austin's supercompiler work
  ☆21Updated 5 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 years ago
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆21Updated last year
• jwiegley / coq-cds4ltl
  A formalization of finite, constructive log analysis using linear temporal logic
  ☆22Updated this week
• jkoppel / thermometer-continuations
  Examples from our paper "Capturing the Future by Replaying the Past"
  ☆21Updated 9 months ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆35Updated 5 years ago
• yveszhang / ldtyping
  ☆12Updated 9 years ago
• ziman / itt
  Tiny dependent calculus with inference of irrelevance and erasure
  ☆15Updated 5 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆25Updated 8 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• gdijkstra / hs-to-gallina
  Experimentation project
  ☆16Updated 11 years ago
• xnning / dependent-types-in-haskell
  Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup
  ☆15Updated 6 years ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆18Updated 6 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 6 months ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated last week
• ollef / dependent-hashmap
  Dependent hash maps
  ☆14Updated 2 months ago
• conal / agda-cat-linear
  Linear map categories in Agda
  ☆5Updated 2 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆24Updated 5 months ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• nomeata / containers-verified
  A package re-exporting the verified subset of containers
  ☆20Updated 7 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• phadej / kleene-type
  Regular expressions of types
  ☆16Updated 6 years ago