Alternatives and similar repositories for typed_tree_calculus:

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

• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆58Updated last year
• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆28Updated this week
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 2 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• leanprover-community / con-nf
  A formal consistency proof of Quine's set theory New Foundations
  ☆69Updated 2 weeks ago
• rzk-lang / sHoTT
  Formalisations for simplicial HoTT and synthetic ∞-categories.
  ☆49Updated 6 months ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆28Updated this week
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆46Updated 5 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆35Updated this week
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• avigad / qpf
  Datatypes as quotients of polynomial functors
  ☆35Updated 4 years ago
• T-Brick / lean-wasm
  Formalising the WASM spec in Lean
  ☆22Updated 10 months ago
• pis147879 / PELCR
  Parallel Environment for optimal Lambda Calculus Reduction
  ☆28Updated 2 years ago
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆27Updated 2 years ago
• T-Brick / c0deine
  Reference compiler for c0
  ☆35Updated 8 months ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 3 weeks ago
• emilyriehl / yoneda
  comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories
  ☆62Updated 6 months ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆32Updated last month
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆28Updated 3 weeks ago
• Lysxia / advent-of-coq-2021
  ☆43Updated 3 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆35Updated last year
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• rocq-community / coqoban
  Sokoban (in Coq) [maintainer=@erikmd]
  ☆22Updated 3 months ago
• digama0 / lean4lean
  Lean 4 kernel / 'external checker' written in Lean 4
  ☆97Updated 2 months ago
• argumentcomputer / LSpec
  A Testing Framework for Lean
  ☆53Updated 2 weeks ago
• gebner / hott3
  HoTT in Lean 3
  ☆79Updated 4 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆29Updated 4 years ago
• hargoniX / socket.lean
  sockets for Lean 4
  ☆18Updated 9 months ago
• Julian / tree-sitter-lean
  Experimental tree-sitter parser for the Lean (4) Theorem Prover
  ☆31Updated 3 months ago