Skip to content
Change the repository type filter

All

    Repositories list

    • MPCTT

      Public
      Modeling and Proving in Computational Type Theory
      Rocq Prover
      1312400Updated Jun 11, 2026Jun 11, 2026
    • Coq
      MIT License
      121954Updated May 26, 2026May 26, 2026
    • Rocq Prover
      MIT License
      101441Updated May 5, 2026May 5, 2026
    • A library of mechanised undecidability proofs in the Coq proof assistant.
      Rocq Prover
      Mozilla Public License 2.0
      35136134Updated Apr 29, 2026Apr 29, 2026
    • Rocq Prover
      MIT License
      51800Updated Feb 16, 2026Feb 16, 2026
    • smpl

      Public
      A Coq plugin providing an extensible tactic similar to first.
      Coq
      MIT License
      6632Updated Oct 29, 2025Oct 29, 2025
    • Extraction framework into weak call-by-value lambda-calculus.
      Coq
      0000Updated Oct 7, 2024Oct 7, 2024
    • Coq
      Other
      33701Updated Jul 14, 2023Jul 14, 2023
    • Coq development of the paper "A Mechanised Proof of the Time Invariance Thesis for the Weak Call-by-value λ-Calculus"
      Coq
      Other
      0300Updated Jul 5, 2023Jul 5, 2023
    • CoqTM

      Public
      Formalising Turing Machines In Coq (bachelor's thesis)
      Coq
      MIT License
      21201Updated Jul 5, 2023Jul 5, 2023
    • Official repository of the Autosubst 2 project.
      Haskell
      Other
      52651Updated May 8, 2023May 8, 2023
    • Coq development accompanying the LFCS'22 paper "Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic"
      Coq
      0400Updated Nov 20, 2022Nov 20, 2022
    • Coq
      Other
      0300Updated Oct 18, 2022Oct 18, 2022
    • MIT License
      1200Updated Jun 17, 2022Jun 17, 2022
    • Coq
      0000Updated Mar 28, 2022Mar 28, 2022
    • Coq
      2201Updated Mar 22, 2022Mar 22, 2022
    • Prog

      Public
      OCaml
      139500Updated Feb 5, 2022Feb 5, 2022
    • Coq
      0300Updated Jan 18, 2022Jan 18, 2022
    • Coq
      0100Updated Oct 26, 2021Oct 26, 2021
    • A Formalization of Kolmogorov Complexity in Synthetic Computability Theory
      HTML
      0200Updated Aug 24, 2021Aug 24, 2021
    • HTML
      Other
      0000Updated May 27, 2021May 27, 2021
    • Static version of https://github.com/uds-psl/coq-library-undecidability for paper "Verified Programming of Turing Machines in Coq"
      HTML
      Other
      0700Updated Apr 22, 2021Apr 22, 2021
    • Coq
      0200Updated Mar 15, 2021Mar 15, 2021
    • 0000Updated Mar 15, 2021Mar 15, 2021
    • Static copy of https://github.com/uds-psl/coq-library-complexity for paper 'Mechanising Complexity Theory: The Cook-Levin Theorem in Coq'
      HTML
      Other
      1600Updated Feb 3, 2021Feb 3, 2021
    • ACT

      Public
      Coq
      0100Updated Jan 24, 2021Jan 24, 2021
    • Opam scripts for smpl plugin
      1000Updated Dec 16, 2020Dec 16, 2020
    • Mechanisation of the paper "Church’s thesis and related axioms in Coq’s type theory"
      HTML
      MIT License
      01000Updated Oct 31, 2020Oct 31, 2020
    • This repository contains the Coq formalisation of the ITP 2019 paper "A certifying extraction with time bounds from Coq to call-by-value λ-calculus".
      Coq
      MIT License
      0400Updated Oct 29, 2020Oct 29, 2020
    • Coq
      MIT License
      4300Updated Oct 26, 2020Oct 26, 2020
    ProTip! When viewing an organization's repositories, you can use the props. filter to filter by custom property.