Alternatives and similar repositories for typecoin

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

• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 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) -…
  ☆12Updated 4 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 7 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 3 months ago
• 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
• ziman / itt
  Tiny dependent calculus with inference of irrelevance and erasure
  ☆15Updated 5 years ago
• pigworker / WhatRTypes4
  being the materials from my YOW LambdaJam 2016 talk
  ☆11Updated 9 years ago
• danelahman / Directed-Containers
  An Agda formalisation of the theory of directed containers
  ☆12Updated 3 months ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 8 years ago
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• Saizan / parametric-demo
  ☆12Updated 6 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 3 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• bobatkey / sorting-types
  Typed DSLs for sorting
  ☆19Updated 7 years ago
• edwinb / ConcIO
  Concurrent IO language with Uniqueness Types
  ☆9Updated 10 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• dalaing / type-systems
  ☆23Updated 7 years ago