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 9 months ago
• meta-logic / sequoia-v0
  Design, play with, and analyze sequent calculus proof systems.
  ☆14Updated last year
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆187Updated 8 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 2 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• acorrenson / minilog
  A verified Implementation of a mini prolog
  ☆17Updated 3 years ago
• wilbowma / pl-thesaurus
  ☆90Updated 4 years ago
• zydeco-lang / zydeco
  a proof-of-concept programming language based on call-by-push-value
  ☆61Updated last week
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆35Updated 4 years ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆174Updated this week
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆101Updated 3 years ago
• diku-dk / staffeli
  DIKU Support Tools for Canvas LMS
  ☆14Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆64Updated last year
• blntk / sfpl
  A simple functional programming language.
  ☆22Updated 4 years ago
• andrejbauer / clerical
  Command-like expressions for real infinite-precision calculations
  ☆55Updated 5 months ago
• jonsterling / project-pterosaur
  ☆45Updated 9 months ago
• jtkristensen / BottomTsh
  A Dependently Timed Drum Machine Language
  ☆11Updated last year
• Kraks / diamond-lang
  A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.
  ☆46Updated 10 months ago
• jashug / IWTypes
  A Coq development of the theory of Indexed W types with function extensionality.
  ☆11Updated 8 years ago
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆173Updated 2 months ago
• slasser / CoStar
  A parser based on the ALL(*) algorithm, implemented and verified in Coq.
  ☆13Updated 2 years ago
• technicalguy / acs-category-theory-notes-2017
  Cambridge ACS Category Theory, Type Theory, and Logic - lecture notes 2017.
  ☆14Updated 8 years ago
• WasmCert / WasmCert-Isabelle
  A mechanisation of Wasm in Isabelle.
  ☆32Updated 2 weeks ago
• julesjacobs / boa
  Partition refinement
  ☆16Updated 2 years ago
• CodaFi / Agda-Metaprogramming
  Dependently Typed Metaprogramming Exercises
  ☆24Updated 7 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆56Updated last week
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 11 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• andrejbauer / faux-type-theory
  ☆46Updated 4 months ago