GaloisInc / saw-coreLinks
The SAW core language.
☆54Updated 4 years ago
Alternatives and similar repositories for saw-core
Users that are interested in saw-core are comparing it to the libraries listed below
Sorting:
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 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
- Real number computation software☆126Updated 2 years ago
- ☆60Updated 6 years ago
- Constructive Galois connections☆34Updated 7 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 7 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆113Updated 5 years ago
- MetaML and MetaOCaml bibliography☆94Updated 8 months ago
- Link to preprints for POPL'18 and colocated events☆87Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Idris LLVM codegen factored out☆82Updated 8 years ago
- Higher-order optimization library☆76Updated 2 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 9 years ago
- higher order dependently typed logic programing☆174Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- ☆21Updated 7 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- A certified semantics for relational programming workout.☆26Updated 4 years ago