GaloisInc / ICryptolLinks
IPython-style interaction for Cryptol
☆15Updated 9 years ago
Alternatives and similar repositories for ICryptol
Users that are interested in ICryptol are comparing it to the libraries listed below
Sorting:
- A type theory based theorem proving library☆25Updated 14 years ago
- convert simple cryptol expressions into finite-state machines☆21Updated 8 years ago
- Automatically exported from code.google.com/p/ghilbert☆47Updated 8 years ago
- Haskell Bindings to the Lean Theorem Prover http://leanprover.github.io/☆22Updated 8 years ago
- ☆29Updated 10 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- ☆33Updated 10 years ago
- A Smarter QuickCheck☆102Updated 8 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆16Updated 5 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 9 months ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- The SAW core language.☆55Updated 4 years ago
- Haskell Equational Reasoning Model-to-Implementation Tunnel☆49Updated 2 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- Symbolic logic expressions☆15Updated 5 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- ☆62Updated 6 years ago
- A concurrency framework for the Ivory language☆45Updated 6 years ago
- A DSL for describing and implementing communication protocols☆84Updated 11 years ago
- A LaTeX package for proof carrying papers☆24Updated 9 years ago
- Formal topology (and some probability) in Coq☆31Updated 7 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 9 years ago
- A formalization of M-types in Agda☆36Updated 5 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Plover is a language for matrix algebra on embedded systems.☆48Updated 4 years ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 10 years ago