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
  ☆24Updated 7 months ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• wilbowma / pl-thesaurus
  ☆90Updated 4 years ago
• blntk / sfpl
  A simple functional programming language.
  ☆22Updated 4 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 last year
• Kraks / diamond-lang
  A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.
  ☆44Updated 8 months ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆184Updated 6 months ago
• zydeco-lang / zydeco
  a proof-of-concept programming language based on call-by-push-value
  ☆59Updated last week
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• MPLLang / mpl-tutorial
  Tutorial for using the MPL compiler for Parallel ML
  ☆23Updated 10 months ago
• T-Brick / molasses
  MLB support for CM (the SML/NJ Compilation and Library Manager)
  ☆18Updated 6 months ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆27Updated last month
• meta-logic / sequoia-v0
  Design, play with, and analyze sequent calculus proof systems.
  ☆14Updated last year
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆101Updated 3 years ago
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆35Updated 3 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• andrejbauer / clerical
  Command-like expressions for real infinite-precision calculations
  ☆55Updated 3 months ago
• andrejbauer / marshall
  Real number computation software
  ☆128Updated 3 years ago
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆31Updated last year
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆170Updated 2 weeks ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆172Updated last week
• jonsterling / project-pterosaur
  ☆45Updated 7 months 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
• ranjitjhala / sprite-lang
  An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.
  ☆150Updated 2 months ago
• jtkristensen / BottomTsh
  A Dependently Timed Drum Machine Language
  ☆10Updated last year
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆32Updated last week
• andrejbauer / faux-type-theory
  ☆46Updated 2 months ago
• julesjacobs / boa
  Partition refinement
  ☆16Updated 2 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago