Alternatives and similar repositories for racets

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

• sweirich / lambda-calculus
  Denotational Semantics of the Untyped Lambda Calculus
  ☆17Updated 5 months ago
• wilbowma / scribble-coq
  Because why wouldn't you want to typeset Coq in Scribble?
  ☆10Updated 5 years ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆19Updated 2 months ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated 7 months ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆25Updated 4 years ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆57Updated 2 weeks ago
• snu-sf / Ordinal
  ☆13Updated 3 months ago
• wilbowma / experimenting-with-redex
  A Redex tutorial with a focus on how to do work in Redex
  ☆11Updated 8 months ago
• CoqHott / logrel-coq
  Logical Relation for MLTT in Coq
  ☆26Updated last week
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆17Updated 2 years ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• rahulc29 / realizability
  Experiments with Realizability in Univalent Type Theory
  ☆18Updated 8 months ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• lawcho / agda2c
  Agda to C compiler
  ☆10Updated 2 years ago
• JonasHoefer / scoped-effects-agda
  An implementation of scoped algebraic effects and handlers in Agda.
  ☆12Updated 4 years ago
• yiyunliu / mltt-consistency
  Logical relation for predicative CC omega with booleans and an intensional identity type
  ☆13Updated 2 months ago
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆28Updated 2 years ago
• michaelballantyne / multiscope
  A module language for programming with multiple named scopes, orthogonal to lexical nesting.
  ☆16Updated 2 years ago
• koengit / intuit
  An automated theorem prover for intuitionistic propostional logic
  ☆12Updated 4 years ago
• brownplt / Resugarer
  Lifting Reduction Semantics through Syntactic Sugar
  ☆13Updated 7 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
• L-TChen / ModalTypeTheory
  ☆21Updated 3 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 7 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 4 months 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
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆16Updated 11 months ago
• uds-psl / CoqTM
  Formalising Turing Machines In Coq (bachelor's thesis)
  ☆12Updated 2 years ago
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 4 years ago
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆30Updated 11 months ago