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
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 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
• 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
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆16Updated 11 months ago
• Barry-Jay / Intensional-computation
  translations of a lambda abstraction to combinations of operators
  ☆18Updated 5 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• yurrriq / idris-logic
  Propositional logic tools, inspired by the Coq standard library.
  ☆9Updated 7 years ago
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆20Updated 4 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• Sintrastes / Montague
  A library for non-deterministically parsing natural language expressions into a structured form.
  ☆17Updated 2 years ago
• elpinal / focused-modules
  A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]
  ☆10Updated 4 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• robrix / sequoia
  classical sequent calculus, embedded in Haskell
  ☆20Updated 3 years ago
• 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
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• xieyuheng / cat
  A categorical semantics library in Agda.
  ☆17Updated 5 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
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 3 years ago
• taktoa / eqsat
  A language-generic implementation of equality saturation in Haskell
  ☆21Updated 6 years ago
• JoeyEremondi / GDTL-artifact
  A Gradual Dependently-typed Language
  ☆14Updated 5 years ago