Alternatives and similar repositories for hoopl

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

• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆45Updated 2 years ago
• jfaure / lfvm-stg
  Map lazy functional language constructs to LLVM IR
  ☆50Updated 6 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 10 months ago
• discus-lang / ddc
  The Disco Discus Compiler
  ☆174Updated 6 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆95Updated 7 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• bollu / simplexhc
  compiler with polyhedral optmization for a lazy functional programming language
  ☆67Updated 7 years ago
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆58Updated 6 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 11 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 8 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆87Updated 7 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• lambda-pi-plus / lambda-pi-plus
  A simple Depdently-Typed Language for Research and Learning
  ☆57Updated 8 years ago
• idris-hackers / idris-llvm
  Idris LLVM codegen factored out
  ☆81Updated 7 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆54Updated 5 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• myuon / ghc-compiler-notes
  A collection of Notes on GHC
  ☆69Updated 6 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• andgate / type-theory-compiler
  Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…
  ☆43Updated 5 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆81Updated 3 years ago
• cronburg / antlr-haskell
  A language parsing quasiquoter for Haskell based heavily on ANTLR4.
  ☆52Updated 4 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆53Updated 3 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago