Alternatives and similar repositories for coop:

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

• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 4 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 2 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 7 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 7 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 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
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆121Updated 3 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 9 months ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 10 months ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• jfaure / lfvm-stg
  Map lazy functional language constructs to LLVM IR
  ☆50Updated 5 years ago
• llvm-hs / llvm-hs-typed
  Type Safe LLVM IR ( Experimental )
  ☆49Updated 6 years ago
• 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
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆34Updated 4 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago