Alternatives and similar repositories for lltp

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

• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆20Updated 5 years ago
• ankitku / TAL0
  Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
  ☆23Updated 9 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 4 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• JacquesCarette / TheoriesAndDataStructures
  Showing how some simple mathematical theories naturally give rise to some common data-structures
  ☆39Updated last year
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆39Updated 8 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 11 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• kai-qu / linear-logic
  An encoding of linear logic in Coq with minimal Sokoban and blocks world examples
  ☆22Updated 4 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆48Updated 6 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆25Updated 6 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated last year
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆41Updated 5 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 7 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆40Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 10 months ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 6 years ago
• jdan / compiler.lean
  A formally verified compiler for a simple language with numbers and sums
  ☆27Updated 5 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 7 years ago
• imdea-software / fcsl-pcm
  Partial Commutative Monoids
  ☆32Updated 8 months ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆12Updated last year
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 5 years ago
• tlringer / thesis
  haha I'm graduating
  ☆14Updated 4 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago