Alternatives and similar repositories for typed_tree_calculus

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

• etiamz / optiscope
  A Lévy-optimal lambda calculus reducer with a backdoor to C
  ☆41Updated this week
• shwestrick / smlfmt
  A custom parser/auto-formatter for Standard ML
  ☆87Updated last month
• engboris / stellogen
  An experimental language exploring computation and meaning through term unification, with logic-agnostic types.
  ☆124Updated last week
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆84Updated 8 years ago
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆35Updated 5 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆64Updated last year
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆65Updated 2 months ago
• fir-lang / fir
  Fir programming language
  ☆91Updated this week
• marvinborner / bruijn
  Programming with pure lambda calculus
  ☆140Updated last month
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 11 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated last week
• andrejbauer / faux-type-theory
  ☆46Updated 4 months ago
• taolson / Admiran
  Admiran is a pure, lazy, functional language and self-hosting compiler based upon Miranda
  ☆85Updated this week
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 10 months ago
• TwoFX / sudoku
  A sudoku game where you have to prove that your deductions are valid
  ☆117Updated 3 years ago
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆40Updated 4 months ago
• standardml / twelf
  The Twelf Programming Language
  ☆149Updated 2 weeks ago
• UberPyro / Prowl-Ideas-Pile
  Ideas, documents, and tutorial pile for the Prowl Language
  ☆12Updated last year
• 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
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆29Updated 3 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 4 years ago
• barry-jay-personal / tree-calculus
  Proofs in Coq for the book Reflective Programs in Tree Calculus
  ☆180Updated 4 years ago
• xieyuheng / inet-forth
  An implementation of interaction nets as a forth-like language.
  ☆44Updated 2 months ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 4 years ago
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆48Updated last year
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆31Updated 9 months ago
• iblech / agdapad
  Agda as a collaborative multiplayer game
  ☆38Updated last year