Alternatives and similar repositories for racket-higher-rank

Users that are interested in racket-higher-rank are comparing it to the libraries listed below

• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 8 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 9 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 10 years ago
• pnwamk / datatype
  (Somewhat) Algebraic Data Types for Racket
  ☆34Updated 2 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 7 years ago
• idris-hackers / idris-posix
  System POSIX bindings for Idris.
  ☆36Updated 7 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• SuzanneSoy / type-expander
  Type expanders (i.e. type-level functions) for Typed/Racket
  ☆16Updated 4 years ago
• cmcl / franklyfrank
  A prototype implementation of the Frank programming language
  ☆17Updated 9 years ago
• dalaing / type-systems
  ☆23Updated 8 years ago
• grin-compiler / idris-grin
  GRIN backend for Idris
  ☆50Updated 5 years ago
• esmolanka / sexp-grammar
  Invertible parsing for S-expressions
  ☆34Updated 9 months ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated 2 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆13Updated 9 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 8 years ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated 8 months ago
• agda-attic / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 7 years ago
• david-christiansen / derive-all-the-instances
  Work on type class deriving with elaboration reflection
  ☆32Updated 7 years ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆36Updated last year
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆48Updated 8 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆55Updated 8 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated last year
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 4 years ago
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 8 years ago