Programming Systems Lab, Saarland University's repositories
coq-library-undecidability
A library of mechanised undecidability proofs in the Coq proof assistant.
autosubst2
Official repository of the Autosubst 2 project.
churchs-thesis-coq
Mechanisation of the paper "Church’s thesis and related axioms in Coq’s type theory"
tm-verification-framework
Static version of https://github.com/uds-psl/coq-library-undecidability for paper "Verified Programming of Turing Machines in Coq"
cook-levin
Static copy of https://github.com/uds-psl/coq-library-complexity for paper 'Mechanising Complexity Theory: The Cook-Levin Theorem in Coq'
certifying-extraction-with-time-bounds
This repository contains the Coq formalisation of the ITP 2019 paper "A certifying extraction with time bounds from Coq to call-by-value λ-calculus".
intuitionistic-epistemic-logic
Coq development accompanying the LFCS'22 paper "Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic"
metacoq-nested-induction
A plugin for induction principles of nested inductive types using MetaCoq
time-invariance-thesis-for-L
Coq development of the paper "A Mechanised Proof of the Time Invariance Thesis for the Weak Call-by-value λ-Calculus"
coq-kolmogorov-complexity
A Formalization of Kolmogorov Complexity in Synthetic Computability Theory
psl-opam-repository
Opam scripts for smpl plugin