Alternatives and similar repositories for cedille-developments

Users that are interested in cedille-developments are comparing it to the libraries listed below

• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆55Updated 8 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆35Updated 5 years ago
• laMudri / quantitative
  ☆16Updated 3 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆54Updated 8 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆31Updated 12 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 2 months ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 4 months ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 6 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆27Updated 9 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 12 years ago
• langston-barrett / coq-big-o
  A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.
  ☆36Updated 8 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 12 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 3 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• JorisCeulemans / sikkel
  Multimode simple type theory as an Agda library.
  ☆23Updated last year
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 6 months ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆31Updated last year
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 3 weeks ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 3 months ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago