Alternatives and similar repositories for SystemFR

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

• Blaisorblade / dot-iris
  Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
  ☆36Updated 3 weeks ago
• Saizan / parametric-demo
  ☆12Updated 6 years ago
• sstucki / f-omega-int-agda
  F-omega with interval kinds mechanized in Agda
  ☆14Updated last year
• TiarkRompf / minidot
  Dependent Object Types (DOT), bottom up
  ☆88Updated 3 years ago
• amaurremi / dot-calculus
  Adding extensions to DOT calculus
  ☆24Updated 5 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• samuelgruetter / dot-calculus
  Formalization of the Dependent Object Types (DOT) calculus
  ☆66Updated 3 years ago
• zilberstein / system-fc-coq
  ☆12Updated 10 years ago
• namin / dafny-sandbox
  Dafny for Metatheory of Programming Languages
  ☆26Updated last month
• uds-psl / autosubst-ocaml
  ☆16Updated 3 months ago
• JacquesCarette / finally-tagless
  Repo of the original work on finally tagless (and a lot of other metaocaml work besides)
  ☆43Updated 6 years ago
• jkoppel / thermometer-continuations
  Examples from our paper "Capturing the Future by Replaying the Past"
  ☆22Updated last year
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆21Updated last year
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• ezyang / lr-agda
  Logical relations proof in Agda
  ☆27Updated 10 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
• math-comp / tutorial_material
  proof script associated to tutorial material
  ☆17Updated last year
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gergoerdi / stlc-agda
  STLC-related snippets in Agda
  ☆16Updated 12 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 3 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 5 months ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 6 years ago
• roglo / banach_tarski
  Formal proof in Coq of Banach-Tarski paradox.
  ☆19Updated this week
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆56Updated 8 years ago
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆26Updated this week
• plclub / lngen
  Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
  ☆32Updated 11 months ago