Alternatives and similar repositories for opetopy:

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

• rdentato / gerku
  An interpreter for concatenative combinators (i.e. Combinators as a functional language)
  ☆10Updated 3 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 6 years ago
• namin / mk-on-smt
  miniKanren for search, SMT for solving
  ☆13Updated 5 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆10Updated 7 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆28Updated 5 years ago
• clf / lollimon
  Lollimon, a monadic concurrent linear logic programming language
  ☆28Updated 13 years ago
• lamdu / lamdu-calculus
  An extended typed Lambda Calculus
  ☆21Updated 6 months ago
• robertkleffner / CaKe
  An interpreter for a minimal but Turing-complete stack based 'concatenative' language.
  ☆19Updated 11 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆37Updated 6 years ago
• Sintrastes / Montague
  A library for non-deterministically parsing natural language expressions into a structured form.
  ☆17Updated 2 years ago
• trillioneyes / idris-pong
  A browser Pong game, taking advantage of Idris's ability to compile to javascript.
  ☆18Updated 10 years ago
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• raphlinus / ghilbert
  Automatically exported from code.google.com/p/ghilbert
  ☆48Updated 7 years ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆40Updated 6 years ago
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 10 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆69Updated 8 years ago
• andrejbauer / marshall
  Real number computation software
  ☆123Updated 2 years ago
• justinpombrio / synless
  Synless is a language-agnostic tree editor.
  ☆21Updated 3 weeks ago
• alox-ai / alox
  GPU Accelerated, Distributed, Actor Model Language (WIP)
  ☆29Updated last year
• sergei-romanenko / spsc
  SPSC: A Small Positive Supercompiler
  ☆34Updated 9 months ago
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆18Updated 4 years ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 12 years ago
• AHartNtkn / Dependent-Binary-Lambda-Calculus
  A Dependently Typed Esolang
  ☆10Updated 7 years ago
• jdan / compiler.lean
  A formally verified compiler for a simple language with numbers and sums
  ☆27Updated 4 years ago
• granstrom / intuitionistic
  Automatically exported from code.google.com/p/intuitionistic
  ☆31Updated 9 years ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 4 months ago
• VictorTaelin / ultimate-calculus
  ☆36Updated 3 years ago
• hydrolarus / cytosol
  A programming language somewhat resembling cellular processes.
  ☆34Updated 2 years ago
• dmurfet / polysemantics
  Polynomial semantics of linear logic
  ☆13Updated 6 years ago