GaloisInc / cryptol-semantics
Semantics for Cryptol
☆16Updated 7 years ago
Alternatives and similar repositories for cryptol-semantics:
Users that are interested in cryptol-semantics are comparing it to the libraries listed below
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- ☆29Updated 9 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- A discouraging story.☆15Updated 7 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- ☆23Updated 7 years ago
- Authenticated Data Structures☆16Updated 9 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated this week
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago
- System F in coq.☆19Updated 10 years ago
- ☆17Updated 2 years ago