Alternatives and similar repositories for swipl-tt:

Users that are interested in swipl-tt are comparing it to the libraries listed below

• sto0pkid / CategoryTheory
  Category Theory in Agda
  ☆13Updated 7 years ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• jfdm / velo-lang
  Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
  ☆16Updated 2 years ago
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆16Updated 9 months ago
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆18Updated 4 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 7 years ago
• meta-logic / lltp
  TPTP linear logic version
  ☆13Updated 3 months ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆14Updated last year
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• smimram / strid
  A string diagram generator for LaTeX.
  ☆26Updated last year
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• joom / direct-reflection-for-free
  using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell
  ☆15Updated 5 years ago
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated 2 months ago
• elpinal / focused-modules
  A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]
  ☆10Updated 4 years ago
• clayrat / idris-linear
  Experiments with linear types
  ☆14Updated 7 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 12 years ago
• atennapel / qtt-ts
  Implementation of Quantitative Type Theory (in TypeScript)
  ☆12Updated 4 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 3 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• conal / agda-cat-linear
  Linear map categories in Agda
  ☆5Updated 2 years ago
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆20Updated last year
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• rfindler / 395-2013
  ☆14Updated 6 years ago