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 6 months ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• meta-logic / sequoia-v0
  Design, play with, and analyze sequent calculus proof systems.
  ☆14Updated last year
• zydeco-lang / zydeco
  a proof-of-concept programming language based on call-by-push-value
  ☆55Updated last month
• jtkristensen / BottomTsh
  A Dependently Timed Drum Machine Language
  ☆10Updated last year
• wilbowma / pl-thesaurus
  ☆89Updated 4 years ago
• jonsterling / project-pterosaur
  ☆44Updated 6 months ago
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆34Updated 3 years ago
• codyroux / name-the-biggest-number
  ☆64Updated 3 years ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆182Updated 5 months ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆172Updated this week
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆98Updated 3 years ago
• logsem / mitten_preorder
  ☆30Updated 2 years ago
• JohnReppy / compiling-pattern-guards
  Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
  ☆25Updated 3 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• Kraks / diamond-lang
  A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.
  ☆45Updated 7 months ago
• thiagofelicissimo / BiTTs
  ☆25Updated last year
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆170Updated 2 weeks ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• lexa-lang / lexa
  ☆39Updated 2 months ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated last month
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 3 months ago
• technicalguy / acs-category-theory-notes-2017
  Cambridge ACS Category Theory, Type Theory, and Logic - lecture notes 2017.
  ☆14Updated 7 years ago
• AndrasKovacs / antifunext
  antifunext
  ☆34Updated last year