Alternatives and similar repositories for Ward:

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

• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 11 years ago
• thoughtpolice / asc
  Austin's supercompiler work
  ☆21Updated 5 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• csgordon / cayenne
  Resurrecting Lennart Augustsson's implementation of Cayenne
  ☆38Updated 11 years ago
• taktoa / eqsat
  A language-generic implementation of equality saturation in Haskell
  ☆21Updated 6 years ago
• chrisdone-archive / ats-examples
  Examples from Introduction to Programming in ATS
  ☆26Updated 10 years ago
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 6 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year
• bitonic / tog
  ☆26Updated 8 years ago
• ollef / Generate-C
  Embedded C code generation DSL for Haskell.
  ☆28Updated 5 years ago
• ecaustin / haskhol-core
  The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.
  ☆2Updated 8 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• mrkgnao / pico
  The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)
  ☆14Updated 7 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆64Updated 11 years ago
• gfour / gic
  The generalized intensional compiler for a Haskell-like language.
  ☆14Updated 7 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• nomeata / ghc-core-smallstep
  A small-step semantics for Core
  ☆9Updated 4 years ago
• minad / persist
  Minimal binary serialization library with focus on performance
  ☆17Updated 4 years ago
• ilyasergey / monadic-cfa
  Generic implementation of different CFA families based on monadic decomposition
  ☆21Updated 12 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• 8l / asif
  A Self-Interpreter for F-omega
  ☆16Updated 9 years ago
• phadej / kleene-type
  Regular expressions of types
  ☆16Updated 6 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• IntelLabs / flrc-lib
  Pillar compiler, Pillar runtime, garbage collector.
  ☆23Updated 2 years ago
• skogsbaer / roundtrip
  Roundtrip allows the definition of bidirectional (de-)serialization specifications
  ☆16Updated 4 months ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• sweirich / hs-inferno
  Generic unification-based type inference library
  ☆25Updated 9 years ago
• elliottt / dang
  A compiler for a strongly typed, haskell-like functional language
  ☆22Updated 7 years ago