Alternatives and similar repositories for asif

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

• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 7 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 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
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 7 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago
• LightAndLight / idris-but-its-c
  Idris, but it's C
  ☆24Updated 7 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• standardml / parcom
  SML Parser Combinator Library
  ☆28Updated 9 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆28Updated 3 weeks ago
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• Deducteam / SizeChangeTool
  A termination checker for higher-order rewriting with dependent types
  ☆10Updated 5 years ago
• JonasHoefer / scoped-effects-agda
  An implementation of scoped algebraic effects and handlers in Agda.
  ☆12Updated 4 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆48Updated 4 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• conal / agda-cat-linear
  Linear map categories in Agda
  ☆5Updated 2 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• agda / ooAgda
  Interactive and object-oriented programming in Agda using coinductive types
  ☆23Updated 6 months ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 6 months ago