vellvm / ollvmLinks
An higher-level LLVM binding for OCaml
☆14Updated 8 years ago
Alternatives and similar repositories for ollvm
Users that are interested in ollvm are comparing it to the libraries listed below
Sorting:
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- secret project☆17Updated 7 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- ☆18Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- ☆33Updated 10 years ago
- ☆18Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- System F in coq.☆19Updated 10 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 8 months ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- Generation of abstract binding trees☆28Updated 8 months ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- xmonad in Coq☆46Updated 12 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
- ☆26Updated 8 years ago
- a version of the 2048 game for Coq☆22Updated last year