Alternatives and similar repositories for opal:

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

• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 8 years ago
• felko / linear-algebra
  Linear algebra formalization in Agda
  ☆16Updated 5 years ago
• argent0 / haskell-ml-benchmark
  Comparing Different Stochastic Gradien Descent implementations in Haskell against Python
  ☆10Updated 8 years ago
• tdammers / ghc-wiki
  The GHC Wiki (kept for archiving purposes, please use version at https://gitlab.haskell.org/ghc/ghc/wikis/)
  ☆12Updated 5 years ago
• seagreen / llvm-in-haskell
  Merged into ian repo: https://github.com/seagreen/ian#llvm-in-haskell
  ☆17Updated 5 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆52Updated last month
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 7 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆44Updated 7 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
• bollu / coremlir
  Encoding of GHC Core inside MLIR
  ☆17Updated 4 years ago
• conal / agda-cat-linear
  Linear map categories in Agda
  ☆5Updated last year
• thinkpad20 / rowling
  A simple, easily embeddable pure-functional language with static typing and row polymorphism.
  ☆10Updated 9 years ago
• dorchard / sessions-in-haskell
  Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"
  ☆15Updated 7 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• SamuelSchlesinger / stm-incremental
  A very simple interface for incremental computation using STM in Haskell.
  ☆13Updated 2 years ago
• Mesabloo / jellyvm
  A VM written following the Linear Abstract Machine architecture
  ☆22Updated 5 years ago
• sheyll / newtype-zoo
  A Zoo of Haskell Newtype Wrappers
  ☆14Updated 4 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 years ago
• haskellari / some
  Existential type.
  ☆36Updated last month
• dorchard / effectful-explanations-talk
  "Programs that explain their effects" talk material
  ☆17Updated 6 years ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 7 years ago
• phadej / bound-extras
  ScopeT and ScopeH
  ☆13Updated 6 months ago
• gergoerdi / universe-of-syntax
  A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…
  ☆16Updated 7 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• mniip / yoctoparsec
  A truly tiny monadic parsing library
  ☆28Updated 4 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• robrix / tilec
  Sometimes when I feel sad I implement a dependently typed lambda calculus.
  ☆15Updated 4 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆21Updated 4 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆49Updated 3 years ago