Alternatives and similar repositories for CATITOR

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

• jtkristensen / Jeopardy
  The official interpreter for the Jeopardy language
  ☆16Updated 2 years ago
• ComputerAidedLL / click-and-collect
  A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml
  ☆22Updated 4 months ago
• catseye / Philomath
  MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)
  ☆16Updated last year
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 3 years ago
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆98Updated 3 years ago
• technicalguy / acs-category-theory-notes-2017
  Cambridge ACS Category Theory, Type Theory, and Logic - lecture notes 2017.
  ☆14Updated 7 years ago
• granstrom / intuitionistic
  Automatically exported from code.google.com/p/intuitionistic
  ☆31Updated 10 years ago
• meta-logic / sequoia-v0
  Design, play with, and analyze sequent calculus proof systems.
  ☆13Updated 11 months ago
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆34Updated 3 years ago
• exaexa / minihm
  toy implementation of Hindley-Milner type system that prints out inference steps
  ☆14Updated 5 months ago
• lpw25 / shifted-names
  Coq library for handling names
  ☆19Updated 3 years ago
• liarokapisv / danac
  A compiler for the Dana programming language
  ☆11Updated 4 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆17Updated 2 weeks ago
• yzyzsun / CP-next
  The Next Generation of Compositional Programming
  ☆52Updated 2 weeks ago
• blntk / sfpl
  A simple functional programming language.
  ☆21Updated 4 years ago
• zydeco-lang / zydeco
  a proof-of-concept programming language based on call-by-push-value
  ☆54Updated last week
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆75Updated 8 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆64Updated 3 years ago
• pdarragh / parsing-with-zippers-paper-artifact
  The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.
  ☆28Updated last year
• ReedOei / Pecan
  An automated theorem prover that uses Büchi automata.
  ☆42Updated 3 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• thiagofelicissimo / BiTTs
  ☆25Updated last year
• andrejbauer / clerical
  Command-like expressions for real infinite-precision calculations
  ☆53Updated 3 weeks ago
• wilbowma / pl-thesaurus
  ☆90Updated 3 years ago
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• evertedsphere / shorshe
  freshly-fermented, dependently-typed mustard, with a substructural aftertaste
  ☆30Updated 5 years ago
• Kraks / diamond-lang
  A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.
  ☆45Updated 5 months ago
• UberPyro / prowl
  WIP stack language that uses regex for control flow
  ☆42Updated last year