Alternatives and similar repositories for racets

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

• wilbowma / scribble-coq
  Because why wouldn't you want to typeset Coq in Scribble?
  ☆10Updated 5 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆23Updated 5 years ago
• sweirich / lambda-calculus
  Denotational Semantics of the Untyped Lambda Calculus
  ☆16Updated 3 months ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆19Updated 3 weeks ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 5 months ago
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆15Updated 2 years ago
• lawcho / agda2c
  Agda to C compiler
  ☆10Updated last year
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated 5 months ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆28Updated 2 weeks ago
• michaelballantyne / ee-lib
  ☆12Updated 11 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• JacquesCarette / Notes
  ☆13Updated last month
• philnguyen / z3-rkt
  Racket bindings for Z3
  ☆24Updated 6 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 2 months ago
• Deducteam / Agda2Dedukti
  ☆19Updated 3 years ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆54Updated last week
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• brownplt / Resugarer
  Lifting Reduction Semantics through Syntactic Sugar
  ☆13Updated 7 years ago
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 4 years ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆14Updated last year
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆33Updated 8 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• 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
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• JonasHoefer / scoped-effects-agda
  An implementation of scoped algebraic effects and handlers in Agda.
  ☆12Updated 4 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated last year
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago