Alternatives and similar repositories for spsc

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

• poitin / Distiller
  Implementation of the distillation algorithm as described in the paper "Distillation: Extracting the Essence of Programs".
  ☆29Updated 3 years ago
• yzyzsun / CP-next
  The Next Generation of Compositional Programming
  ☆56Updated 2 weeks ago
• kirkedal / rfun-interp
  Interpreter for the reversible functional language rFun
  ☆38Updated 7 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆84Updated 8 years ago
• standardml / twelf
  The Twelf Programming Language
  ☆150Updated 3 weeks ago
• ilya-klyuchnikov / ttlite
  A SuperCompiler for Martin-Löf's Type Theory
  ☆123Updated 4 years ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆65Updated last week
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆35Updated 5 years ago
• ilya-klyuchnikov / sc-mini
  SC Mini is a "minimal" positive supercompiler
  ☆48Updated 5 years ago
• ngzhian / ski
  SKI combinators
  ☆56Updated 8 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆36Updated this week
• ncihnegn / miranda
  Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…
  ☆65Updated 8 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 4 years ago
• aprolog-lang / aprolog
  αProlog
  ☆18Updated 2 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆58Updated 5 years ago
• mtt-lang / mtt-lang
  A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web
  ☆47Updated 3 years ago
• boyland / sasylf
  Educational Proof Assistant for Type Theory
  ☆80Updated 3 weeks ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• theoremprover-museum / theoremprover-museum.github.io
  ☆56Updated 9 months ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 10 months ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆31Updated last year
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆99Updated last year
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆51Updated 11 years ago
• astampoulis / makam
  The Makam Metalanguage
  ☆199Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• owo-lang / narc-rs
  (WIP) Dependently-typed programming language with Agda style dependent pattern matching
  ☆80Updated 5 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆98Updated 2 weeks ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆65Updated last year