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 4 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- 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 Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- ☆36Updated 3 years 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
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- quotient types in cubical Agda☆24Updated 6 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated last year
- my phd thesis☆26Updated last year
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 4 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 7 months ago
- Agda to C compiler☆10Updated 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
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Quasi-quoting library for agda☆18Updated 9 months ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ☆13Updated last month
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 10 months ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- ☆17Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago