Suikaba / SelingerQuantumLambdaCalculusLinks
Implementatoin of Selinger's Typed Quantum Lambda Calculus
☆13Updated 6 years ago
Alternatives and similar repositories for SelingerQuantumLambdaCalculus
Users that are interested in SelingerQuantumLambdaCalculus are comparing it to the libraries listed below
Sorting:
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- A (formalised) general definition of type theories☆58Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- Library for Classical Coq☆39Updated 6 months ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last week
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 4 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆69Updated last year
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- Monadic effects and equational reasoning in Rocq☆73Updated last week
- Algebraic Combinatorics in Coq☆39Updated 2 months ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year