Alternatives and similar repositories for shifted-names

Users that are interested in shifted-names are comparing it to the libraries listed below

• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 3 months ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated last year
• logsem / mitten_preorder
  ☆30Updated 2 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 3 months ago
• pigworker / EGTBS
  being the introduction to co-de-Bruijn metasyntax
  ☆23Updated 3 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated 2 years ago
• flupe / generics
  ☆23Updated last year
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆18Updated 7 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• mietek / imla2017
  Agda formalisation of NbE for λ□
  ☆18Updated 7 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago
• JacquesCarette / finally-tagless
  Repo of the original work on finally tagless (and a lot of other metaocaml work besides)
  ☆43Updated 6 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 5 years ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 5 months ago
• laMudri / quantitative
  ☆16Updated 3 years ago
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 7 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 4 months ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 7 months ago
• liamoc / dddp
  Deferring the Details and Deriving Programs
  ☆14Updated 6 years ago
• jespercockx / cubes
  An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…
  ☆12Updated 9 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago