Alternatives and similar repositories for agda-intro:

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

• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 5 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 6 months ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 7 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• dalaing / type-systems
  ☆23Updated 7 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 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
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 5 months 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 4 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 7 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆15Updated 6 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 9 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 7 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• shlevy / cat-fiat
  An attempt to formalize unix cat in fiat
  ☆12Updated 7 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago