Alternatives and similar repositories for reflection-tutorial

Users that are interested in reflection-tutorial are comparing it to the libraries listed below

• jonsterling / coq-domains
  ☆18Updated 3 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 6 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated last month
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 5 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 7 months ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆28Updated last year
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 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 4 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 11 years ago
• TOTBWF / agda-sgd
  Experiments in Synthetic Differential Geometry
  ☆16Updated 4 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 6 years ago
• gallais / agda-presburger
  Deciding Presburger arithmetic in agda
  ☆33Updated 2 years ago
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆21Updated 3 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 6 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆18Updated last year
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆21Updated last year
• laMudri / quantitative
  ☆16Updated 3 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated last year
• jonsterling / sml-logical-framework
  Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought
  ☆14Updated 8 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆32Updated 2 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• JacquesCarette / finally-tagless
  Repo of the original work on finally tagless (and a lot of other metaocaml work besides)
  ☆43Updated 7 years ago