evincarofautumn / WardLinks
A static analysis tool for C.
☆27Updated 5 years ago
Alternatives and similar repositories for Ward
Users that are interested in Ward are comparing it to the libraries listed below
Sorting:
- Miller/pattern unification in Agda☆65Updated 11 years ago
- The generalized intensional compiler for a Haskell-like language.☆14Updated 7 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 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
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- The Prettiest Printer☆34Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 11 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- ☆26Updated 8 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Regular expressions of types☆16Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Examples from Introduction to Programming in ATS☆26Updated 10 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- ☆22Updated 9 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- A tool for translating imperative programs to CSP.☆12Updated 8 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Used libraries: llvm-general, llvm-general-pure - 3.4.2-1; llvm version: 3.4.2-1; Based on http://www.stephendiehl.com/llvm/ solution.☆7Updated 9 years ago