Alternatives and similar repositories for r5rs-denot

Users that are interested in r5rs-denot are comparing it to the libraries listed below

• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 7 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆48Updated 5 years ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 4 years ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated 7 months ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 12 years ago
• haskell-implementations / hugs
  Haskell User's Gofer System
  ☆25Updated 9 years ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆48Updated 10 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• siraben / mini-haskell
  A self-hosting mini Haskell compiler with a mini C runtime.
  ☆76Updated 5 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 8 years ago
• sfultong / stand-in-language
  a simple total pure functional language, eventually to have powerful static checking and optimization
  ☆33Updated 3 weeks ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 3 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago
• JonasHoefer / scoped-effects-agda
  An implementation of scoped algebraic effects and handlers in Agda.
  ☆12Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• sergei-romanenko / spsc
  SPSC: A Small Positive Supercompiler
  ☆35Updated last year
• clf / lollimon
  Lollimon, a monadic concurrent linear logic programming language
  ☆28Updated 13 years ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆40Updated 6 years ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• khayyamsaleem / gradual-typing
  an implementation of gradual typing in mit-scheme
  ☆9Updated 4 years ago
• namin / blond
  the reflective tower Blond by Olivier Danvy & Karoline Malmkjær
  ☆16Updated last month
• orchid-hybrid / minimips
  minikanren mips assembler/disassembler
  ☆32Updated 10 years ago
• kyledewey / typed-prolog
  A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.
  ☆29Updated 7 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• rocq-community / reglang
  Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]
  ☆44Updated last month