RedPRL / sml-cats

Related projects: ⓘ

• jonsterling / type-refinements-for-the-working-class
  ☆15Updated this week
• jonsterling / aspects-of-cubical-type-theory
  ☆11Updated this week
• freebroccolo / agda-cubical-sets
  ☆14Updated this week
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 8 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆16Updated 7 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 6 years ago
• freebroccolo / agda-prelude
  ☆14Updated this week
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 9 years ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆14Updated 9 years ago
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 7 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 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 3 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 6 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆21Updated 4 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• pigworker / Ming
  being the emperor of Mongo, but also a verb
  ☆15Updated 5 years ago
• pigworker / Ohrid-Agda
  being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017
  ☆9Updated 7 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• freebroccolo / lambda-battle
  ☆23Updated this week
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• gergoerdi / stlc-agda
  STLC-related snippets in Agda
  ☆15Updated 11 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 8 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 7 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 7 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 9 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 6 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 9 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆23Updated 7 years ago