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 3 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
  ☆24Updated 10 months ago
• meta-logic / sequoia-v0
  Design, play with, and analyze sequent calculus proof systems.
  ☆14Updated last year
• technicalguy / acs-category-theory-notes-2017
  Cambridge ACS Category Theory, Type Theory, and Logic - lecture notes 2017.
  ☆14Updated 8 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• jtkristensen / BottomTsh
  A Dependently Timed Drum Machine Language
  ☆11Updated last year
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆101Updated 3 years ago
• wilbowma / pl-thesaurus
  ☆90Updated 4 years ago
• ReedOei / Pecan
  An automated theorem prover that uses Büchi automata.
  ☆44Updated 4 years ago
• codyroux / name-the-biggest-number
  ☆64Updated 3 years ago
• catseye / Philomath
  MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)
  ☆16Updated 2 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆66Updated 5 years ago
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆35Updated 4 years ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆187Updated last week
• frex-project / idris-frex
  ☆52Updated 5 months ago
• evertedsphere / shorshe
  freshly-fermented, dependently-typed mustard, with a substructural aftertaste
  ☆30Updated 5 years ago
• logsem / mitten_preorder
  ☆31Updated 2 years ago
• CodaFi / Agda-Metaprogramming
  Dependently Typed Metaprogramming Exercises
  ☆24Updated 8 years ago
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆75Updated 11 months ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆80Updated 5 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆64Updated last year
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆29Updated 3 months ago
• jonsterling / project-pterosaur
  ☆45Updated 10 months ago
• jashug / IWTypes
  A Coq development of the theory of Indexed W types with function extensionality.
  ☆11Updated 8 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆122Updated 8 months ago
• Kraks / diamond-lang
  A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.
  ☆46Updated 11 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆56Updated 2 weeks ago
• catseye / Mascarpone
  MIRROR of https://codeberg.org/catseye/Mascarpone : You are lost in a twisty maze of meta-circular interpreters, all alike.
  ☆23Updated 2 years ago