Alternatives and similar repositories for polysemantics

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

• 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
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 11 years ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 8 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆21Updated 3 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 7 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 8 years ago
• pigworker / WhatRTypes4
  being the materials from my YOW LambdaJam 2016 talk
  ☆11Updated 9 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 6 years ago
• gergoerdi / stlc-agda
  STLC-related snippets in Agda
  ☆16Updated 12 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 2 months ago
• michaelsproul / dblib-linear
  Formalisation of the linear lambda calculus in Coq
  ☆10Updated 7 years 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) -…
  ☆13Updated 5 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 8 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆24Updated 5 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 7 years ago
• kai-qu / linear-logic
  An encoding of linear logic in Coq with minimal Sokoban and blocks world examples
  ☆22Updated 3 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 7 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆28Updated 2 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 4 years ago
• jwiegley / coq-cds4ltl
  A formal verification of Linear Temporal Logic in Coq
  ☆23Updated 2 months ago
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆21Updated 2 years ago
• jkoppel / thermometer-continuations
  Examples from our paper "Capturing the Future by Replaying the Past"
  ☆23Updated last year
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 11 years ago