GaloisInc / LIMALinks
LIMA: Language for Integrated Modeling and Analysis
☆12Updated 6 years ago
Alternatives and similar repositories for LIMA
Users that are interested in LIMA are comparing it to the libraries listed below
Sorting:
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆16Updated 9 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 8 months ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Idris, but it's C☆24Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- An attempt to formalize unix cat in fiat☆12Updated 8 years ago
- ☆29Updated 9 years ago
- Proof checker for propositional logic☆16Updated 8 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 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
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- ☆22Updated 9 years ago
- "Fail Fast" process management for Haskell; inspired by Erlang☆16Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- A tutorial on writing a concurrency testing tool in Haskell☆12Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Updated 4 years ago
- ☆17Updated 6 years ago
- Roundtrip allows the definition of bidirectional (de-)serialization specifications☆16Updated 10 months ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- secret project☆17Updated 7 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- "Programs that explain their effects" talk material☆17Updated 7 years ago