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
• 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
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 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
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆18Updated 4 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆20Updated 11 months ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 7 years ago
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 7 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆10Updated 10 months ago
• effectfully / Eff
  Experiments with effect systems
  ☆12Updated 8 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
• Zekt / Type-Embellishment
  Experimenting on ornamentation in Agda via reflection.
  ☆12Updated last year
• elpinal / focused-modules
  A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]
  ☆10Updated 4 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago
• Barry-Jay / Intensional-computation
  translations of a lambda abstraction to combinations of operators
  ☆18Updated 5 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated last year
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• alhassy / multistage-programming-taha
  A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''
  ☆10Updated 6 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated last month