Alternatives and similar repositories for rfun-interp

Users that are interested in rfun-interp are comparing it to the libraries listed below

• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 7 years ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆65Updated last week
• gebner / hott3
  HoTT in Lean 3
  ☆82Updated 5 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆116Updated 5 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆57Updated 5 years ago
• clf / celf
  ☆62Updated 6 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆70Updated 2 months ago
• andrejbauer / marshall
  Real number computation software
  ☆129Updated 3 years ago
• namin / clpsmt-miniKanren
  CLP(SMT) on top of miniKanren
  ☆38Updated 3 years ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆59Updated 3 weeks ago
• mietek / research
  Work in progress
  ☆39Updated 7 months ago
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆98Updated last year
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆44Updated 6 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 12 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆63Updated last year
• theoremprover-museum / theoremprover-museum.github.io
  ☆56Updated 8 months ago
• namin / metaprogramming
  Course on Metaprogramming
  ☆74Updated 6 months ago
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆76Updated 4 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆80Updated 4 months ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆31Updated 4 years ago
• jkoppel / ecta
  ☆37Updated last year
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆57Updated last month
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆60Updated last year
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 3 months ago
• rocq-archive / coq-in-coq
  A formalisation of the Calculus of Constructions
  ☆70Updated last year
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆127Updated 10 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆85Updated 9 years ago