uds-psl / CoqTMLinks
Formalising Turing Machines In Coq (bachelor's thesis)
☆12Updated last year
Alternatives and similar repositories for CoqTM
Users that are interested in CoqTM are comparing it to the libraries listed below
Sorting:
- ☆36Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experiments with higher-order abstract syntax in Agda☆22Updated 2 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- my phd thesis☆26Updated 10 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- Quasi-quoting library for agda☆17Updated 6 months ago
- ☆15Updated last year
- ModTT in Agda☆11Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated 2 months ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- Agda to C compiler☆10Updated 2 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- ☆29Updated 2 years ago
- Notes (and implementation) of unification with binders☆14Updated last month
- ☆16Updated last month
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆13Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 2 months ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago