Alternatives and similar repositories for MLPolyR

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

• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• nojb / mlpolyr
  MLpolyR
  ☆7Updated 8 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• thautwarm / idris-cam
  Sucessor: https://github.com/thautwarm/Quick-Backend
  ☆24Updated 5 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆30Updated 4 years ago
• daanx / effect-bench
  Benchmarking algebraic effect handler implementations
  ☆26Updated 3 years ago
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆91Updated 6 months ago
• xnning / TypeInfer
  Type inference for 'type level computation one step at a time'
  ☆12Updated 7 years ago
• fpottier / pprint
  A pretty-printing combinator library for OCaml
  ☆51Updated 9 months ago
• m-yac / agda-knots
  An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory
  ☆13Updated 6 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 5 months ago
• Trebor-Huang / agda-linear
  An implementation of a Zeilberger-style linear type theory.
  ☆11Updated 3 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆45Updated 2 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆36Updated last year
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• Guest0x0 / trebor
  an implementation of Observational Type Theory (OTT) and more
  ☆26Updated 2 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• geisha-lang / Geisha
  A naive θ..θ programming language
  ☆27Updated 6 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆48Updated 10 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆28Updated 3 weeks ago
• kino3 / Mini-TT
  mirror of A simple type-theoretic language: Mini-TT
  ☆40Updated 8 years ago