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:
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- ☆18Updated 8 years ago
- ☆33Updated 10 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 7 months ago
- Semantics for Cryptol☆16Updated 7 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 11 years ago
- secret project☆17Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A discouraging story.☆16Updated 7 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- ☆26Updated 8 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆16Updated 9 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago