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:
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- ☆38Updated 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 4 years ago
- my phd thesis☆26Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 3 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- Agda to C compiler☆10Updated 4 months ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- quotient types in cubical Agda☆24Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 2 weeks ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 5 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.☆23Updated 9 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 3 years ago
- Complexity analysis in Lean☆10Updated 2 years ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- Implementations of various toy programming languages☆12Updated 7 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- haha I'm graduating☆14Updated 4 years ago
- Faceted execution in Racket☆11Updated 7 years ago
- Quasi-quoting library for agda☆18Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago