Alternatives and similar repositories for gradual-typing-performance

Users that are interested in gradual-typing-performance 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 7 years ago
• philnguyen / z3-rkt
  Racket bindings for Z3
  ☆24Updated 6 years ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆30Updated 3 years ago
• JoeyEremondi / GDTL-artifact
  A Gradual Dependently-typed Language
  ☆14Updated 6 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆32Updated 7 years ago
• wilbowma / experimenting-with-redex
  A Redex tutorial with a focus on how to do work in Redex
  ☆11Updated 8 months ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated 2 years ago
• rocq-community / metaprogramming-rosetta-stone
  A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…
  ☆17Updated last year
• QuickChick / Luck
  Luck -- A Language for Property-Based Generators
  ☆35Updated 4 months ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 2 months ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• rfindler / 395-2013
  ☆14Updated 6 years ago
• koengit / intuit
  An automated theorem prover for intuitionistic propostional logic
  ☆12Updated 4 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆52Updated 2 months ago
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated 6 months ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆75Updated 3 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆30Updated last month
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 4 months ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 3 months ago
• halfaya / BayHac
  ☆11Updated 7 years ago
• wilbowma / scribble-coq
  Because why wouldn't you want to typeset Coq in Scribble?
  ☆10Updated 5 years ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆59Updated 9 months ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago