Alternatives and similar repositories for aprolog:

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

• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆48Updated 10 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 7 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 5 years ago
• coq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆30Updated 3 years ago
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆32Updated 8 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 2 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• 8l / asif
  A Self-Interpreter for F-omega
  ☆16Updated 9 years ago
• ilya-klyuchnikov / ttlite
  A SuperCompiler for Martin-Löf's Type Theory
  ☆120Updated 3 years ago
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆18Updated 4 years ago
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆19Updated 8 years ago
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 years ago
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆16Updated 7 months ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆64Updated 11 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆40Updated 6 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆50Updated 2 weeks ago
• metaocaml / ber-metaocaml
  Unofficial git mirror of the BER MetaOCaml patchset.
  ☆65Updated last year
• rossberg / mixml
  MixML prototype interpreter
  ☆27Updated 5 years ago
• boyland / twelf-library
  Library classes for the Twelf Proof System
  ☆21Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 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
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago