uds-psl / CoqTMLinks
Formalising Turing Machines In Coq (bachelor's thesis)
☆12Updated 2 years ago
Alternatives and similar repositories for CoqTM
Users that are interested in CoqTM are comparing it to the libraries listed below
Sorting:
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆36Updated 3 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 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
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 3 months ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- my phd thesis☆26Updated last year
- ☆13Updated last week
- quotient types in cubical Agda☆24Updated 6 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Agda to C compiler☆10Updated 2 years ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 9 months ago
- An embedding of ZFC into Agda☆13Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated last week
- Interactive Theorem Proving for students☆20Updated last year
- Faceted execution in Racket☆12Updated 6 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Complexity analysis in Lean☆10Updated last year
- Monadic effects and equational reasoning in Rocq☆72Updated 3 weeks ago
- ☆15Updated last year
- Yoneda lemma in every known language☆17Updated 2 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago