Alternatives and similar repositories for cur

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

• stchang / macrotypes
  ☆137Updated 3 years ago
• teyjus / teyjus
  An efficient implementation of the higher-order logic programming language Lambda Prolog
  ☆157Updated last year
• racket / redex
  ☆98Updated this week
• namin / staged-miniKanren
  multi-stage relational programming for staged relational interpreters: running with holes, faster
  ☆137Updated 4 months ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 7 years ago
• gelisam / klister
  an implementation of stuck macros
  ☆148Updated last week
• mietek / charity-lang
  Charity language interpreters and literature
  ☆114Updated 6 years ago
• RedPRL / sml-redprl
  The People's Refinement Logic
  ☆228Updated 2 years ago
• astampoulis / makam
  The Makam Metalanguage
  ☆200Updated 2 years ago
• Andromedans / andromeda
  A proof assistant for general type theories
  ☆308Updated 3 months ago
• plum-umd / abstracting-definitional-interpreters
  Abstracting Definitional Interpreters
  ☆73Updated 7 years ago
• michaelballantyne / faster-minikanren
  A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.
  ☆162Updated 9 months ago
• ProofSystem / Encyclopedia
  An Open Encyclopedia of Proof Systems
  ☆119Updated 3 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆55Updated 5 years ago
• rain-1 / continuations-study-group
  ☆79Updated 6 years ago
• PLTools / OCanren
  Statically typed embedding of miniKanren relational programming language into OCaml
  ☆119Updated last month
• jonsterling / JonPRL
  An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …
  ☆110Updated 6 years ago
• dvanhorn / redex-aam-tutorial
  An Introduction to Redex with Abstracting Abstract Machines
  ☆104Updated last year
• SMLFamily / The-Mechanization-of-Standard-ML
  The Mechanization of Standard ML
  ☆74Updated 3 years ago
• clf / celf
  ☆62Updated 6 years ago
• ezyang / logitext
  Beautiful, interactive visualizations of logical inference
  ☆149Updated 4 years ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆211Updated 6 years ago
• nanopass / nanopass-framework-racket
  nanopass compiler framework for Racket
  ☆192Updated last year
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆213Updated 3 years ago
• ekmett / propagators
  The Art of the Propagator. See also:
  ☆177Updated last year
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• stedolan / malfunction
  Malfunctional Programming
  ☆350Updated last year
• sweirich / tal
  An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
  ☆149Updated 4 years ago
• jrslepak / Remora
  Dependently-typed language with Iverson-style implicit lifting
  ☆126Updated 5 years ago
• ekmett / guanxi
  Relational programming in Haskell. Mostly developed on twitch.
  ☆266Updated last year