letouzey / coq-minicalc

Related projects: ⓘ

• SimonBoulier / TypingFlags
  A Coq plugin to disable positivity check, guard check and termination check
  ☆16Updated 4 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 5 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 5 years ago
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 4 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated 10 months ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• bedrocksystems / coq-lens
  Lenses in Coq
  ☆17Updated last year
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 7 years ago
• freebroccolo / lambda-battle
  ☆23Updated this week
• bedrocksystems / cpp2v
  ☆14Updated this week
• freebroccolo / agda-cubical-sets
  ☆14Updated this week
• metaocaml / metaocaml-opam
  A repository of MetaOCaml packages
  ☆12Updated last year
• pi8027 / efficient-finfun
  ☆13Updated 4 years ago
• thery / PolTac
  Tactic for polynomial manipulations
  ☆10Updated 7 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 7 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆15Updated 4 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 3 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆16Updated 3 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
• michaelsproul / dblib-linear
  Formalisation of the linear lambda calculus in Coq
  ☆10Updated 5 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆26Updated 3 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆33Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 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
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆18Updated 5 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 4 years ago