uds-psl Goto Github PK

2020-fscd-semi-unification

Mechanization (in the Coq proof assistant) of a synthetic many-one reduction from "uniform boundedness of deterministic simple stack machines" to "semi-unification".

2020-types-propositional-calculi

Mechanization (in the Coq proof assistant) of synthetic many-one reductions from the binary modified Post correspondence problem to several problems for propositional calculi.

act

autosubst-metacoq

autosubst-ocaml

autosubst2

Official repository of the Autosubst 2 project.

ba-gaeher

Bachelor project of Lennard Gäher.

base-library

cbv-lambda-calculus-reasonable

The formalized part of the POPL 2020 Paper "The Weak Call-By-Value λ-Calculus is Reasonable for Both Time and Space"

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".

churchs-thesis-coq

Mechanisation of the paper "Church’s thesis and related axioms in Coq’s type theory"

constructive-and-synthetic-reducibility-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'

coq-a-la-carte-cpp20

coq-kolmogorov-complexity

A Formalization of Kolmogorov Complexity in Synthetic Computability Theory

coq-library-complexity

coq-library-fol

coq-library-undecidability

A library of mechanised undecidability proofs in the Coq proof assistant.

coq-posts-theorem

coq-synthetic-computability

coq-synthetic-incompleteness

coq-undecidability-subtyping

coqtm

Formalising Turing Machines In Coq (bachelor's thesis)

fol-completeness-theorems

Source code accompanying the Bachelor's thesis of Dominik Wehr.

h10

Static version of https://github.com/uds-psl/coq-library-undecidability for paper "Hilbert's tenth problem in Coq"

h10-lmcs

Static version of https://github.com/uds-psl/coq-library-undecidability for paper "Hilbert's tenth problem in Coq" (extended version for LMCS)

h10-lmcs-v1.1

higher-order-unification-undecidability

Source code accompanying the Bachelor's thesis of Simon Spies.

ill-undecidability

Certified Undecidability of Intuitionistic Linear Logic via Binary Stack Machines and Minsky Machines

intuitionistic-epistemic-logic

Coq development accompanying the LFCS'22 paper "Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic"