evincarofautumn / WardLinks
A static analysis tool for C.
☆28Updated 5 years ago
Alternatives and similar repositories for Ward
Users that are interested in Ward are comparing it to the libraries listed below
Sorting:
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆37Updated 12 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- The generalized intensional compiler for a Haskell-like language.☆14Updated 7 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- ☆26Updated 8 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- The Prettiest Printer☆35Updated last year
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A package re-exporting the verified subset of containers☆20Updated 7 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 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
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A compiler for a strongly typed, haskell-like functional language☆22Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Examples from Introduction to Programming in ATS☆26Updated 11 years ago