Alternatives and similar repositories for agdARGS

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

• ilya-klyuchnikov / henk
  Pure Type Systems for Functional Programming
  ☆31Updated 4 years ago
• osa1 / MANTI
  A pure subset of Prolog, implemented in Haskell
  ☆31Updated 12 years ago
• maximedenes / coq-amd64
  ☆22Updated 9 years ago
• MrChico / Reals-in-agda
  Constructive definition of real numbers implemented in agda.
  ☆10Updated 9 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆68Updated 11 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 5 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated 10 months ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• jonsterling / agda-effectful-forcing
  Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…
  ☆12Updated 5 years ago
• ISANobody / sill
  ☆29Updated 10 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆48Updated 11 years ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆31Updated 4 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 9 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 8 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• michaelballantyne / meta-minikanren
  A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!
  ☆22Updated 9 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
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 8 years ago
• kai-qu / linear-logic
  An encoding of linear logic in Coq with minimal Sokoban and blocks world examples
  ☆22Updated 3 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 8 years ago