Alternatives and similar repositories for x86-agda

Users that are interested in x86-agda are comparing it to the libraries listed below

• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 3 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 11 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 3 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆53Updated last month
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• csgordon / cayenne
  Resurrecting Lennart Augustsson's implementation of Cayenne
  ☆38Updated 12 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated last month
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆45Updated 2 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 5 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 months ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 10 months ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• taktoa / eqsat
  A language-generic implementation of equality saturation in Haskell
  ☆21Updated 6 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆114Updated 5 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆53Updated 6 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆95Updated 7 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆76Updated 3 weeks ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 4 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 3 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year